Communications of the ACM
SIAM Journal on Computing
An introduction to computational learning theory
An introduction to computational learning theory
Lower bounds for sampling algorithms for estimating the average
Information Processing Letters
The nature of statistical learning theory
The nature of statistical learning theory
Let sleeping files lie: pattern matching in Z-compressed files
Journal of Computer and System Sciences
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Majorizing estimators and the approximation of #P-complete problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
External memory algorithms
Towards estimation error guarantees for distinct values
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Testing and spot-checking of data streams (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Detection, Estimation, and Modulation Theory: Radar-Sonar Signal Processing and Gaussian Signals in Noise
An optimal algorithm for Monte Carlo estimation
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Tight bounds for depth-two superconcentrators
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Approximate L1-Difference Algorithm for Massive Data Streams
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Compressed-domain techniques for image/video indexing and manipulation
ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sampling lower bounds via information theory
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Three theorems regarding testing graph properties
Random Structures & Algorithms
SIA: secure information aggregation in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An improved data stream algorithm for frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Streaming and sublinear approximation of entropy and information distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Probabilistic validation of aggregated data in vehicular ad-hoc networks
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
SIA: Secure information aggregation in sensor networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Event dissemination via group-aware stream filtering
Proceedings of the second international conference on Distributed event-based systems
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Group-aware stream filtering for bandwidth-efficient data dissemination
International Journal of Parallel, Emergent and Distributed Systems - Best Papers from the WWASN2007 Workshop
Local approximation of pagerank and reverse pagerank
Proceedings of the 17th ACM conference on Information and knowledge management
Sublinear Algorithms for Approximating String Compressibility
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Optimal sampling from sliding windows
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Sublinear estimation of entropy and information distances
ACM Transactions on Algorithms (TALG)
Journal of Network and Computer Applications
Adversary lower bounds for nonadaptive quantum algorithms
Journal of Computer and System Sciences
Scalable Uniform Graph Sampling by Local Computation
SIAM Journal on Scientific Computing
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
Sublinear algorithms in the external memory model
Property testing
Sublinear algorithms in the external memory model
Property testing
Proceedings of the forty-third annual ACM symposium on Theory of computing
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
Optimal sampling from sliding windows
Journal of Computer and System Sciences
Efficient quantile retrieval on multi-dimensional data
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On approximation algorithms for data mining applications
Efficient Approximation and Online Algorithms
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Constant-Time approximation algorithms for the knapsack problem
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Estimating sum by weighted sampling
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Testing Closeness of Discrete Distributions
Journal of the ACM (JACM)
Optimal hashing schemes for entity matching
Proceedings of the 22nd international conference on World Wide Web
Learning mixtures of arbitrary distributions over large discrete domains
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We develop a framework to study probabilistic sampling algorithms that approximate general functions of the form \genfunc, where \domain and \range are arbitrary sets. Our goal is to obtain lower bounds on the query complexity of functions, namely the number of input variables x_i that any sampling algorithm needs to query to approximate f(x_1,\ldots,x_n).We define two quantitative properties of functions --- the it block sensitivity and the minimum Hellinger distance --- that give us techniques to prove lower bounds on the query complexity. These techniques are quite general, easy to use, yet powerful enough to yield tight results. Our applications include the mean and higher statistical moments, the median and other selection functions, and the frequency moments, where we obtain lower bounds that are close to the corresponding upper bounds.We also point out some connections between sampling and streaming algorithms and lossy compression schemes.