63 search results - page 3 / 13 » Improved bounds for dictionary look-up with one error |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
COLT
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Recent advances in scene understanding and related tasks
have highlighted the importance of using regions to reason
about high-level scene structure. Typically, the regions are
...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Two central criteria for data quality are consistency and accuracy. Inconsistencies and errors in a database often emerge as violations of integrity constraints. Given a dirty dat...