5166 search results - page 744 / 1034 » Web Query Optimizer |
99
Voted
STOC
2002
ACM
16 years 1 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
95
Voted
EDBT
2006
ACM
16 years 28 days ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
107
Voted
ICDE
2010
IEEE
16 years 17 days ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
72
Voted
DCC
2006
IEEE
16 years 12 days ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
150
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...