1450 search results - page 199 / 290 » On the Complexity of Hardness Amplification |
WPES
2003
ACM
14 years 2 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
ISAAC
2003
Springer
14 years 2 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...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
JCDL
2010
ACM
14 years 2 months ago
2010
ACM
In recent years, the vast amount of digitally available content has lead to the creation of many topic-centered digital libraries. Also in the domain of chemistry more and more di...