Sciweavers

1971 search results - page 78 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
ESANN
2004
13 years 9 months ago
Using Andrews Curves for Clustering and Sub-clustering Self-Organizing Maps
Abstract. The use of self-organizing maps to analyze data often depends on finding effective methods to visualize the SOM's structure. In this paper we propose a new way to pe...
Cesar García-Osorio, Jesús Maudes, C...
SGP
2007
13 years 10 months ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
CLUSTER
2007
IEEE
14 years 2 months ago
Effects of packet pacing for MPI programs in a Grid environment
— Improving the performance of TCP communication is the key to the successful deployment of MPI programs in a Grid environment in which multiple clusters are connected through hi...
Ryousei Takano, Motohiko Matsuda, Tomohiro Kudoh, ...
SAC
2006
ACM
14 years 1 months ago
Two-phase clustering strategy for gene expression data sets
In the context of genome research, the method of gene expression analysis has been used for several years. Related microarray experiments are conducted all over the world, and con...
Dirk Habich, Thomas Wächter, Wolfgang Lehner,...
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
14 years 2 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han