Sciweavers

274 search results - page 17 / 55
» On Random Sampling over Joins
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 2 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
102
Voted
IJCAI
2007
15 years 3 months ago
ProbLog: A Probabilistic Prolog and Its Application in Link Discovery
We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belo...
Luc De Raedt, Angelika Kimmig, Hannu Toivonen
CRYPTO
2007
Springer
116views Cryptology» more  CRYPTO 2007»
15 years 8 months ago
Random Oracles and Auxiliary Input
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
Dominique Unruh
DKE
2008
109views more  DKE 2008»
15 years 1 months ago
Deterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
Hüseyin Akcan, Alex Astashyn, Hervé Br...
173
Voted
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 2 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