64 search results - page 7 / 13 » A New Quartet Tree Heuristic for Hierarchical Clustering |
IJCV
2008
13 years 7 months ago
2008
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
IV
2008
IEEE
14 years 1 months ago
2008
IEEE
The recent revolution of digital camera technology has resulted in much larger collections of images. Image browsing techniques thus become increasingly important for overview and...
CAGD
2005
13 years 7 months ago
2005
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The...
CGF
2006
13 years 7 months ago
2006
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...