1941 search results - page 188 / 389 » On the Hardness of Approximate Reasoning |
168
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
174
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
176
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
212
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
150
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...