4007 search results - page 294 / 802 » Computation with imprecise probabilities |
131
click to vote
FCS
2006
15 years 6 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
119
click to vote
WSC
2004
15 years 6 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
133
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
In discriminative training, such as Maximum Mutual Information Estimation (MMIE) training, a word lattice is usually used as a compact representation of many different sentence hy...
172
click to vote
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
147
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...