Sciweavers

3652 search results - page 259 / 731
» A study of query length
Sort
View
129
Voted
INTR
2010
157views more  INTR 2010»
15 years 1 months ago
Classifying the user intent of web queries using k-means clustering
Purpose – Web search engines are frequently used by people to locate information on the Internet. However, not all queries have an informational goal. Instead of information, so...
Ashish Kathuria, Bernard J. Jansen, Carolyn Hafern...
JCST
2010
155views more  JCST 2010»
14 years 10 months ago
Efficient Location Updates for Continuous Queries over Moving Objects
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
SIGIR
2011
ACM
14 years 6 months ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
16 years 4 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
15 years 10 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron