4007 search results - page 79 / 802 » Computation with imprecise probabilities |
153
Voted
WADS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
103
Voted
COLING
1996
15 years 1 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
88
Voted
JMLR
2010
14 years 7 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
126
Voted
ECCV
1994
Springer
15 years 4 months ago
1994
Springer
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
In this study a confidence measure for probability density functions (pdfs) is presented. The measure can be used in one-class classification to select a pdf threshold for class i...