789 search results - page 90 / 158 » On Theory Revision with Queries |
113
Voted
SWAT
2000
Springer
15 years 4 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
137
click to vote
PODS
1995
ACM
15 years 4 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
126
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
132
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
98
Voted
TREC
2003
15 years 2 months ago
2003
Our participation in TREC 2003 aims to adapt the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) to the robust track and the topic distillation task o...