17 search results - page 3 / 4 » Tradeoffs in Approximate Range Searching Made Simpler |
SIGIR
1998
ACM
13 years 10 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
CGF
2010
13 years 5 months ago
2010
We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the cova...
SIGMOD
2002
ACM
14 years 5 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
IHI
2010
13 years 18 days ago
2010
Regulations in various countries permit the reuse of health information without patient authorization provided the data is "de-identified". In the United States, for ins...