Sciweavers

158 search results - page 31 / 32
» Approximate Range Mode and Range Median Queries
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 7 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 7 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 6 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 6 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 20 days ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim