876 search results - page 36 / 176 » Limits on the Usefulness of Random Oracles |
ECML
2003
Springer
14 years 4 months ago
2003
Springer
Due to the unavoidable fact that a robot’s sensors will be limited in some manner, it is entirely possible that it can find itself unable to distinguish between differing state...
DIS
2008
Springer
14 years 16 days ago
2008
Springer
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
EUROCRYPT
2007
Springer
14 years 5 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
COLT
2001
Springer
14 years 3 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
ALGORITHMICA
2006
13 years 10 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...