Sciweavers

3969 search results - page 646 / 794
» Query Processing Using Ontologies
Sort
View
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
15 years 8 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
SIGIR
2010
ACM
15 years 8 months ago
Assessing the scenic route: measuring the value of search trails in web logs
Search trails mined from browser or toolbar logs comprise queries and the post-query pages that users visit. Implicit endorsements from many trails can be useful for search result...
Ryen W. White, Jeff Huang
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 2 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
WSDM
2012
ACM
258views Data Mining» more  WSDM 2012»
14 years 9 days ago
Large-scale analysis of individual and task differences in search result page examination strategies
Understanding the impact of individual and task differences on search result page examination strategies is important in developing improved search engines. Characterizing these e...
Georg Buscher, Ryen W. White, Susan T. Dumais, Jef...
SIGIR
2012
ACM
13 years 7 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel