Sciweavers

2750 search results - page 300 / 550
» Learning Efficient Parsing
Sort
View
NIPS
2001
15 years 5 months ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
126
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 10 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
ECCV
1998
Springer
16 years 5 months ago
Active Appearance Models
?We describe a new method of matching statistical models of appearance to images. A set of model parameters control modes of shape and gray-level variation learned from a training ...
Timothy F. Cootes, Gareth J. Edwards, Christopher ...
127
Voted
ICML
2008
IEEE
16 years 4 months ago
An asymptotic analysis of generative, discriminative, and pseudolikelihood estimators
Statistical and computational concerns have motivated parameter estimators based on various forms of likelihood, e.g., joint, conditional, and pseudolikelihood. In this paper, we ...
Percy Liang, Michael I. Jordan
ICML
2008
IEEE
16 years 4 months ago
A rate-distortion one-class model and its applications to clustering
In one-class classification we seek a rule to find a coherent subset of instances similar to a few positive examples in a large pool of instances. The problem can be formulated an...
Koby Crammer, Partha Pratim Talukdar, Fernando Per...