Sciweavers

160 search results - page 9 / 32
» Some Theorems on the Algorithmic Approach to Probability The...
Sort
View
28
Voted
WWW
2005
ACM
14 years 8 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
DOLAP
2004
ACM
14 years 28 days ago
Cardinality-based inference control in OLAP systems: an information theoretic approach
We address the inference control problem in data cubes with some data known to users through external knowledge. The goal of inference controls is to prevent exact values of sensi...
Nan Zhang 0004, Wei Zhao, Jianer Chen
CSL
2010
Springer
13 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
FOCS
2000
IEEE
13 years 12 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
TIM
2010
144views Education» more  TIM 2010»
13 years 2 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta