688 search results - page 23 / 138 » Reverse Tree Clustering |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
COLING
2008
13 years 9 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
In this paper we define a Topological Tree (TT) as a knowledge representation method that aims to describe important visual and spatial features of image regions, namely the color...
INTERSPEECH
2010
13 years 2 months ago
2010
In large vocabulary continuous speech recognition, decision trees are widely used to cluster triphone states. In addition to commonly used phonetically based questions, others hav...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
It is common in object recognition algorithms based on viewpoint consistency to find object poses that align many of the object features with features extracted from a search imag...