198 search results - page 11 / 40 » Infinite mixtures of trees |
BMCBI
2011
13 years 3 months ago
2011
FUIN
2010
13 years 6 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
TCS
2010
13 years 3 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We present a unified model for face detection, pose estimation, and landmark estimation in real-world, cluttered images. Our model is based on a mixtures of trees with a shared p...