4007 search results - page 682 / 802 » Computation with imprecise probabilities |
178
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
168
click to vote
EDCC
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...
205
click to vote
FSTTCS
1992
Springer
15 years 10 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
182
click to vote
ICCV
1995
IEEE
15 years 10 months ago
1995
IEEE
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
170
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...