160 search results - page 8 / 32 » Some Theorems on the Algorithmic Approach to Probability The... |
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
ISNN
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. In this paper, some sufficient conditions are obtained to guarantee that discrete time cellular neural networks (DTCNNs) can have some stable memory patterns. These condi...
ACL
2004
13 years 9 months ago
2004
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
ISIPTA
2003
IEEE
14 years 23 days ago
2003
IEEE
The nature of much information available to decision makers is vague and imprecise, be it information for human managers in organisations or for process agents in a distributed co...
INFORMS
2008
13 years 7 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...