Sciweavers

65 search results - page 8 / 13
» Uniform Derandomization from Pathetic Lower Bounds
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
On unbiased estimation of sparse vectors corrupted by Gaussian noise
We consider the estimation of a sparse parameter vector from measurements corrupted by white Gaussian noise. Our focus is on unbiased estimation as a setting under which the difï¬...
Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Y...
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak
CP
2008
Springer
13 years 9 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
COMPGEOM
2010
ACM
14 years 13 days ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
COLT
2010
Springer
13 years 5 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos