268 search results - page 41 / 54 » Exploiting the Similarity of Non-Matching Terms at Retrieval... |
164
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
103
click to vote
SIGMOD
2010
ACM
14 years 8 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
MOBISYS
2004
ACM
15 years 9 months ago
2004
ACM
The amount of personal digital media is increasing, and managing it has become a pressing problem. Effective management of media content is not possible without content-related me...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
105
click to vote
KDD
2012
ACM
13 years 1 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...