Sciweavers

786 search results - page 33 / 158
» An Efficient k-Means Clustering Algorithm: Analysis and Impl...
Sort
View
ESANN
2008
13 years 9 months ago
Parallelizing single patch pass clustering
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
Nikolai Alex, Barbara Hammer
CGF
2004
127views more  CGF 2004»
13 years 8 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
VISUALIZATION
2002
IEEE
14 years 1 months ago
Efficient Simplification of Point-Sampled Surfaces
In this paper we introduce, analyze and quantitatively compare a number of surface simplification methods for point-sampled geometry. We have implemented incremental and hierarchi...
Mark Pauly, Markus H. Gross, Leif Kobbelt
ICCAD
1994
IEEE
82views Hardware» more  ICCAD 1994»
14 years 14 days ago
A timing analysis algorithm for circuits with level-sensitive latches
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
Jin-fuw Lee, Donald T. Tang, C. K. Wong
IJDMB
2007
114views more  IJDMB 2007»
13 years 8 months ago
A parallel edge-betweenness clustering tool for Protein-Protein Interaction networks
: The increasing availability of protein-protein interaction graphs (PPI) requires new efficient tools capable of extracting valuable biological knowledge from these networks. Amon...
Qiaofeng Yang, Stefano Lonardi