Sciweavers

198 search results - page 14 / 40
» Infinite mixtures of trees
Sort
View
ISNN
2004
Springer
14 years 2 months ago
Unsupervised Learning for Hierarchical Clustering Using Statistical Information
This paper proposes a novel hierarchical clustering method that can classify given data without specified knowledge of the number of classes. In this method, at each node of a hie...
Masaru Okamoto, Nan Bu, Toshio Tsuji
DLT
2010
13 years 9 months ago
Minimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
Sylvia Friese, Helmut Seidl, Sebastian Maneth
DM
2008
104views more  DM 2008»
13 years 8 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
NHM
2010
100views more  NHM 2010»
13 years 3 months ago
A 2-adic approach of the human respiratory tree
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
Frédéric Bernicot, Bertrand Maury, D...
LICS
2010
IEEE
13 years 6 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...