Sciweavers

2520 search results - page 268 / 504
» The complexity of approximating entropy
Sort
View
WSC
2004
15 years 8 months ago
On Using Monte Carlo Methods for Scheduling
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...
Samarn Chantaravarapan, Ali K. Gunal, Edward J. Wi...
FOCS
2008
IEEE
15 years 6 months ago
Hardness of Nearest Neighbor under L-infinity
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
TOG
2008
85views more  TOG 2008»
15 years 6 months ago
Robust treatment of simultaneous collisions
Robust treatment of complex collisions is a challenging problem in cloth simulation. Some state of the art methods resolve collisions iteratively, invoking a fail-safe when a boun...
David Harmon, Etienne Vouga, Rasmus Tamstorf, Eita...
TVCG
2008
128views more  TVCG 2008»
15 years 6 months ago
AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
Anish Chandak, Christian Lauterbach, Micah T. Tayl...