324 search results - page 47 / 65 » Distance Approximating Trees: Complexity and Algorithms |
SBCCI
2003
ACM
14 years 19 days ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...