Sciweavers

1434 search results - page 57 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
SSPR
2000
Springer
13 years 11 months ago
Assessing the Computational Effort for Structural 3D Vehicle Recognition
A model based structural recognition approach is used for 3D detection and localization of vehicles. It is theoretically founded by syntactic pattern recognition using coordinate g...
Eckart Michaelsen, Uwe Stilla
STACS
2010
Springer
14 years 2 months ago
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
Edward A. Hirsch, Dmitry Itsykson
BSL
2005
70views more  BSL 2005»
13 years 7 months ago
Mass problems and randomness
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
Stephen G. Simpson
ARC
2009
Springer
188views Hardware» more  ARC 2009»
14 years 2 months ago
Word-Length Optimization and Error Analysis of a Multivariate Gaussian Random Number Generator
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
Chalermpol Saiprasert, Christos-Savvas Bouganis, G...
ALT
2008
Springer
14 years 4 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...