18 search results - page 3 / 4 » Fast Approximate PCPs for Multidimensional Bin-Packing Probl... |
EDBT
2006
ACM
14 years 10 months 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...
SIGMOD
2001
ACM
14 years 10 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
PODS
2004
ACM
14 years 10 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...