Advanced feedback methods in information retrieval
Journal of the American Society for Information Science
Algorithms
A direct manipulation interface for boolean information retrieval via natural language query
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Using collaborative filtering to weave an information tapestry
Communications of the ACM - Special issue on information filtering
A graphical filter/flow representation of Boolean queries: a prototype implementation and evaluation
Journal of the American Society for Information Science
Index structures for selective dissemination of information under the Boolean model
ACM Transactions on Database Systems (TODS)
Modelling of user preferences and needs in Boolean retrieval systems
Information Processing and Management: an International Journal
Content routing for distributed information servers
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Information Retrieval
Internet Resource Discovery Services
Computer
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
The Efficacy of GlOSS for the Text Database Discovery Problem
The Efficacy of GlOSS for the Text Database Discovery Problem
Shortest-substring retrieval and ranking
ACM Transactions on Information Systems (TOIS)
Building efficient and effective metasearch engines
ACM Computing Surveys (CSUR)
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Autonomous Agents and Multi-Agent Systems
A comprehensive model for web search evaluation
CSECS'06 Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing
| Hi-index | 0.00 |
As the number of Internet servers increases rapidly, it becomes difficult to determine the relevant servers when searching for information. We develop a new method to rank Internet servers for Boolean queries. Our method reduces time and space complexity from exponential to polynomial in the number of Boolean terms. We contrast it with other known methods and describe its implementation.