Sciweavers

779 search results - page 24 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
ITNG
2006
IEEE
14 years 1 months ago
Overlap Among Major Web Search Engines
Purpose – This paper reports the findings of a major study examining the overlap among results retrieved by three major web search engines. The goal of the research was to: mea...
Amanda Spink, Bernard J. Jansen, Chris Blakely, Sh...
DNIS
2010
Springer
250views Database» more  DNIS 2010»
14 years 2 months ago
Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a gene...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
VLDB
1998
ACM
87views Database» more  VLDB 1998»
13 years 11 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 7 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
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