Sciweavers

339 search results - page 39 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
ICRA
2006
IEEE
144views Robotics» more  ICRA 2006»
15 years 3 months ago
Adapting Probabilistic Roadmaps to Handle Uncertain Maps
Abstract— Randomized motion planning techniques are responsible for many of the recent successes in robot control. However, most motion planning algorithms assume perfect and com...
Patrycja E. Missiuro, Nicholas Roy
93
Voted
IPMI
2003
Springer
15 years 10 months ago
A New & Robust Information Theoretic Measure and Its Application to Image Alignment
In this paper we develop a novel measure of information in a random variable based on its cumulative distribution that we dub cumulative residual entropy (CRE). This measure parall...
Fei Wang, Baba C. Vemuri, Murali Rao, Yunmei Chen
SI3D
2010
ACM
15 years 4 months ago
Stochastic transparency
Stochastic transparency provides a unified approach to orderindependent transparency, anti-aliasing, and deep shadow maps. It augments screen-door transparency using a random sub...
Eric Enderton, Erik Sintorn, Peter Shirley, David ...
58
Voted
ICDCS
1999
IEEE
15 years 1 months ago
Interpreting Stale Load Information
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
Michael Dahlin
ICS
2010
Tsinghua U.
15 years 1 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell