Sciweavers

459 search results - page 70 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
88
Voted
COLING
2002
14 years 11 months ago
A Comparative Evaluation of Data-driven Models in Translation Selection of Machine Translation
We present a comparative evaluation of two data-driven models used in translation selection of English-Korean machine translation. Latent semantic analysis(LSA) and probabilistic ...
Yuseop Kim, Jeong Ho Chang, Byoung-Tak Zhang
PAMI
2007
187views more  PAMI 2007»
14 years 11 months ago
Supervised Learning of Semantic Classes for Image Annotation and Retrieval
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
Gustavo Carneiro, Antoni B. Chan, Pedro J. Moreno,...
FORMATS
2010
Springer
14 years 9 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...
CVPR
2011
IEEE
14 years 7 months ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer
ICASSP
2011
IEEE
14 years 3 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...