Sciweavers

3019 search results - page 426 / 604
» Approximating the Domatic Number
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 11 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
15 years 11 months ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath
VLDB
2001
ACM
114views Database» more  VLDB 2001»
15 years 11 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 11 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...