Sciweavers

4553 search results - page 97 / 911
» Distributed Ranked Search
Sort
View
SIGIR
2004
ACM
14 years 1 months ago
Learning to cluster web search results
Organizing Web search results into clusters facilitates users' quick browsing through search results. Traditional clustering techniques are inadequate since they don't g...
Hua-Jun Zeng, Qi-Cai He, Zheng Chen, Wei-Ying Ma, ...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 2 months ago
Automated generation of object summaries from relational databases: A novel keyword searching paradigm
— This paper introduces a novel keyword searching paradigm in Relational Databases (DBs), where the result of a search is a ranked set of Object Summaries (OSs). An OS summarizes...
Georgios John Fakas
CIKM
2008
Springer
13 years 10 months ago
Searching the wikipedia with contextual information
We propose a framework for searching the Wikipedia with contextual information. Our framework extends the typical keyword search, by considering queries of the type q, p , where q...
Antti Ukkonen, Carlos Castillo, Debora Donato, Ari...
ISAAC
2003
Springer
134views Algorithms» more  ISAAC 2003»
14 years 1 months ago
New Ways to Construct Binary Search Trees
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
Travis Gagie
SIGIR
2012
ACM
11 years 10 months ago
Time-sensitive query auto-completion
Query auto-completion (QAC) is a common feature in modern search engines. High quality QAC candidates enhance search experience by saving users time that otherwise would be spent ...
Milad Shokouhi, Kira Radinsky