Sciweavers

241 search results - page 12 / 49
» Learning Classes of Probabilistic Automata
Sort
View
ICGI
2010
Springer
13 years 5 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
COLT
1995
Springer
13 years 11 months ago
On Learning Bounded-Width Branching Programs
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
CVPR
2001
IEEE
14 years 9 months ago
Learning Probabilistic Distribution Model for Multi-View Face Detection
Modeling subspaces of a distribution of interest in high dimensional spaces is a challenging problem in pattern analysis. In this paper, we present a novel framework for pose inva...
Lie Gu, Stan Z. Li, HongJiang Zhang
AIME
2007
Springer
14 years 1 months ago
Hierarchical Latent Class Models and Statistical Foundation for Traditional Chinese Medicine
Traditional Chinese medicine (TCM) is an important avenue for disease prevention and treatment for the Chinese people and is gaining popularity among others. However, many remain s...
Nevin Lianwen Zhang, Shihong Yuan, Tao Chen, Yi Wa...
LATA
2010
Springer
14 years 14 days ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau