Sciweavers

241 search results - page 9 / 49
» Learning Classes of Probabilistic Automata
Sort
View
JALC
2007
90views more  JALC 2007»
13 years 7 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
CVPR
2003
IEEE
14 years 9 months ago
Object Class Recognition by Unsupervised Scale-Invariant Learning
We present a method to learn and recognize object class models from unlabeled and unsegmented cluttered scenes in a scale invariant manner. Objects are modeled as flexible constel...
Robert Fergus, Pietro Perona, Andrew Zisserman
EMNLP
2009
13 years 5 months ago
Multi-Class Confidence Weighted Algorithms
The recently introduced online confidence-weighted (CW) learning algorithm for binary classification performs well on many binary NLP tasks. However, for multi-class problems CW l...
Koby Crammer, Mark Dredze, Alex Kulesza
ENTCS
2006
130views more  ENTCS 2006»
13 years 7 months ago
Modularity in Coalgebra
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
Corina Cîrstea
ICML
2005
IEEE
14 years 8 months ago
Recognition and reproduction of gestures using a probabilistic framework combining PCA, ICA and HMM
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
Sylvain Calinon, Aude Billard