6251 search results - page 221 / 1251 » Randomness, Computability, and Density |
158
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
122
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
143
click to vote
CA
2002
IEEE
15 years 9 months ago
2002
IEEE
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...
139
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
147
click to vote
COMPGEOM
1998
ACM
15 years 8 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...