1254 search results - page 132 / 251 » Making Hard Problems Harder |
WPES
2003
ACM
14 years 3 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...
COMPGEOM
2010
ACM
14 years 3 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 3 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 ...
PODS
2010
ACM
14 years 3 months ago
2010
ACM
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
SIGMOD
2010
ACM
14 years 3 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...