905 search results - page 64 / 181 » On the Complexity of uSPR Distance |
109
click to vote
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
The medial surface of a volumetric object is of significant interest for shape analysis. However, its numerical computation can be subtle. Methods based on Voronoi techniques prese...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
Natural scene images brought new challenges for a few years and one of them is text understanding over images or videos. Text extraction which consists to segment textual foregrou...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
IDEAL
2004
Springer
15 years 3 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...