705 search results - page 60 / 141 » Proximity Cluster Trees |
162
click to vote
COMPGEOM
2000
ACM
15 years 9 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
136
click to vote
RECOMB
2004
Springer
16 years 5 months ago
2004
Springer
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
147
click to vote
WEBI
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
135
click to vote
WACV
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
155
click to vote
SSPR
2004
Springer
15 years 10 months ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...