1820 search results - page 63 / 364 » Hierarchical Clustering of Words |
SODA
1998
ACM
15 years 18 days ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
ICPR
2006
IEEE
16 years 11 days ago
2006
IEEE
This work presents the application of a novel technique on dimensionality reduction to deal with multispectral images. A distance based on mutual information is used to construct ...
123
click to vote
GECCO
2009
Springer
15 years 5 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. ...
ROMAN
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract— This paper describes a novel algorithm for autonomous and incremental learning of motion pattern primitives by observation of human motion. Human motion patterns are ed...
ICAPR
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...