Sciweavers

149 search results - page 27 / 30
» Uniform hashing in constant time and linear space
Sort
View
ECCC
2010
98views more  ECCC 2010»
13 years 7 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
ICDCS
2006
IEEE
14 years 2 months ago
Routing in Networks with Low Doubling Dimension
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg,...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
14 years 2 months ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 15 days ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 8 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor