Sciweavers

179 search results - page 14 / 36
» On Approximating the Average Distance Between Points
Sort
View
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 4 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
COMPGEOM
2004
ACM
15 years 9 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
COMPGEOM
2009
ACM
15 years 10 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
COMPGEOM
1998
ACM
15 years 8 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
VISUALIZATION
2005
IEEE
15 years 9 months ago
Evolutionary Morphing
We introduce a technique to visualize the gradual evolutionary change of the shapes of living things as a morph between known three-dimensional shapes. Given geometric computer mo...
David F. Wiley, Nina Amenta, Dan A. Alcantara, Deb...