3652 search results - page 14 / 731 » A study of query length |
125
click to vote
ECCC
2010
14 years 6 months ago
2010
Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...
113
Voted
ECIR
2009
Springer
14 years 9 months ago
2009
Springer
Query expansion is an effective technique in improving the retrieval performance for ad-hoc retrieval. However, query expansion can also fail, leading to a degradation of the retri...
SIAMCOMP
2008
14 years 11 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
CP
2008
Springer
15 years 1 months ago
2008
Springer
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...