60 search results - page 9 / 12 » Formulating Good Queries for Prior Art Search |
WWW
2003
ACM
14 years 7 months ago
2003
ACM
Continuous queries are queries for which responses given to users must be continuously updated, as the sources of interest get updated. Such queries occur, for instance, during on...
SIGMOD
2010
ACM
13 years 6 months ago
2010
ACM
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
SIGMOD
2012
ACM
11 years 9 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
SIGIR
2008
ACM
13 years 6 months ago
2008
ACM
Recent work on language models for information retrieval has shown that smoothing language models is crucial for achieving good retrieval performance. Many different effective smo...
ICDE
2012
IEEE
11 years 9 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...