Sciweavers

1434 search results - page 40 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
IPPS
1998
IEEE
13 years 12 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
CVPR
2011
IEEE
12 years 11 months ago
Adaptive Random Forest - How many ``experts'' to ask before making a decision?
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...
Alexander Schwing, Christopher Zach, Yefeng Zheng,...
ICPR
2000
IEEE
14 years 8 months ago
A Markov Random Field Model for Automatic Speech Recognition
Speech can be represented as a time/frequency distribution of energy using a multi-band filter bank. A Markov random field model, which takes into account the possible time asynch...
Gérard Chollet, Guillaume Gravier, Marc Sig...
AIIA
2009
Springer
14 years 2 months ago
Partitioning Search Spaces of a Randomized Search
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...