Sciweavers

1038 search results - page 37 / 208
» Space-Bounded Query Approximation
Sort
View
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 5 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
EDBT
2006
ACM
190views Database» more  EDBT 2006»
15 years 12 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
CGI
1998
IEEE
15 years 4 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
FOCS
2003
IEEE
15 years 5 months ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 8 days ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...