Sciweavers

SSD
1993
Springer
91views Database» more  SSD 1993»
13 years 9 months ago
Volumes From Overlaying 3-D Triangulations in Parallel
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
Wm. Randolph Franklin, Mohan S. Kankanhalli
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
14 years 5 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...