Sciweavers

342 search results - page 22 / 69
» Branch-and-bound processing of ranked queries
Sort
View
SIGIR
2006
ACM
14 years 1 months ago
Improving web search ranking by incorporating user behavior information
We show that incorporating user behavior data can significantly improve ordering of top results in real web search setting. We examine alternatives for incorporating feedback into...
Eugene Agichtein, Eric Brill, Susan T. Dumais
SIGIR
2008
ACM
13 years 7 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 1 months ago
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...
Kostas Patroumpas, Timos K. Sellis
ICASSP
2008
IEEE
14 years 1 months ago
Query by humming of midi and audio using locality sensitive hashing
This paper proposes a query by humming method based on locality sensitive hashing (LSH). The method constructs an index of melodic fragments by extracting pitch vectors from a dat...
Matti Ryynänen, Anssi Klapuri
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis