Sciweavers

641 search results - page 31 / 129
» Studying Query Expansion Effectiveness
Sort
View
HT
2005
ACM
14 years 1 months ago
Queries as anchors: selection by association
This paper introduces a new method for linking the world view of the search engine user community with that of the search engine itself. This new method is based on collecting and...
Einat Amitay, Adam Darlow, David Konopnicki, Uri W...
CHI
1997
ACM
13 years 12 months ago
Queries? Links? Is there a Difference?
Hypertext interfaces are considered appropriate for information exploration tasks. The prohibitively expensive link creation effort, however, prevents traditional hypertext interf...
Gene Golovchinsky
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
FLAIRS
2006
13 years 9 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
WWW
2008
ACM
14 years 8 months ago
Sailer: an effective search engine for unified retrieval of heterogeneous xml and web documents
This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data. We propose an effective search engine called Sailer to adaptively and versa...
Guoliang Li, Jianhua Feng, Jianyong Wang, Xiaoming...