9683 search results - page 606 / 1937 » Predicting query performance |
236
click to vote
TKDE
2010
15 years 2 months ago
2010
The sparse data is becoming increasingly common and available in many real-life applications. However, relative little attention has been paid to effectively model the sparse data ...
245
Voted
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
179
Voted
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
203
click to vote
VLDB
2007
ACM
16 years 1 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
181
click to vote
MM
2005
ACM
16 years 25 days ago
2005
ACM
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...