Sciweavers

4007 search results - page 103 / 802
» Computation with imprecise probabilities
Sort
View
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
15 years 6 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 4 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
95
Voted
ENTCS
2007
104views more  ENTCS 2007»
15 years 17 days ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
PSIVT
2009
Springer
130views Multimedia» more  PSIVT 2009»
15 years 7 months ago
Compact Fundamental Matrix Computation
Abstract. A very compact algorithm is presented for fundamental matrix computation from point correspondences over two images. The computation is based on the strict maximum likeli...
Kenichi Kanatani, Yasuyuki Sugaya
CSDA
2004
191views more  CSDA 2004»
15 years 14 days ago
Computing the distribution of the product of two continuous random variables
We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...
Andrew G. Glen, Lawrence Leemis, John H. Drew