79 search results - page 12 / 16 » Applications of Quick-Combine for Ranked Query Models |
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
NIPS
2007
13 years 8 months ago
2007
We propose a model that leverages the millions of clicks received by web search engines to predict document relevance. This allows the comparison of ranking functions when clicks ...
CIKM
2004
Springer
14 years 25 days ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
JCDL
2004
ACM
14 years 26 days ago
2004
ACM
With the growth of digital music, content-based music retrieval (CBMR) has attracted increasingly attention. For most CBMR systems, the task is to return music objects similar to ...