32545 search results - page 289 / 6509 » Data Structures and Algorithms |
116
click to vote
TLDI
2003
ACM
15 years 9 months ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
160
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
121
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
136
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
137
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we present Triplify ? a simplistic but effective approach to publish Linked Data from relational databases. Triplify is based on mapping HTTP-URI requests onto relat...