Sciweavers

9886 search results - page 387 / 1978
» Learning Compressible Models
Sort
View
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 9 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
ACIIDS
2010
IEEE
204views Database» more  ACIIDS 2010»
15 years 10 months ago
An Unsupervised Learning and Statistical Approach for Vietnamese Word Recognition and Segmentation
There are two main topics in this paper: (i) Vietnamese words are recognized and sentences are segmented into words by using probabilistic models; (ii) the optimum probabilistic mo...
Hieu Le Trung, Vu Le Anh, Kien Le Trung
BMVC
2001
15 years 7 months ago
Learning Pixel-Wise Signal Energy for Understanding Semantics
Visual interpretation of events requires both an appropriate representation of change occurring in the scene and the application of semantics for differentiating between different...
Jeffrey Ng, Shaogang Gong
EMNLP
2007
15 years 6 months ago
What Can Syntax-Based MT Learn from Phrase-Based MT?
We compare and contrast the strengths and weaknesses of a syntax-based machine translation model with a phrase-based machine translation model on several levels. We briefly descr...
Steve DeNeefe, Kevin Knight, Wei Wang 0006, Daniel...
JMLR
2000
134views more  JMLR 2000»
15 years 4 months ago
Learning with Mixtures of Trees
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
Marina Meila, Michael I. Jordan