Sciweavers

4007 search results - page 95 / 802
» Computation with imprecise probabilities
Sort
View
ICPR
2004
IEEE
16 years 1 months ago
Resolution Enhancement by AdaBoost
This paper proposes a learning scheme based still image super-resolution reconstruction algorithm. Superresolution reconstruction is proposed as a binary classification problem an...
Bhaskar D. Rao, Junwen Wu, Mohan M. Trivedi
123
Voted
JVA
2006
IEEE
15 years 6 months ago
Nearest Neighbour Criterion - Analitical Performance Evaluation
In this paper we consider the capabilities of nearest neighbor as a criterion of data association to ensure correct decision in associating measurement to target. We continue the ...
Ljudmil V. Bojilov
ACS
2011
14 years 7 months ago
The Compositional Construction of Markov Processes
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
Luisa de Francesco Albasini, Nicoletta Sabadini, R...
LREC
2010
186views Education» more  LREC 2010»
15 years 2 months ago
WITcHCRafT: A Workbench for Intelligent exploraTion of Human ComputeR conversaTions
We present Witchcraft, an open-source framework for the evaluation of prediction models for spoken dialogue systems based on interaction logs and audio recordings. The use of Witc...
Alexander Schmitt, Gregor Bertrand, Tobias Heinrot...
ICCV
2005
IEEE
16 years 2 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu