4039 search results - page 251 / 808 » A Method for Dynamic Clustering of Data |
181
click to vote
NIPS
2001
15 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
162
click to vote
CLUSTER
2008
IEEE
16 years 1 months ago
2008
IEEE
—A commodity personal computer (PC) can be seen as a hybrid computing system equipped with two different kinds of processors, i.e. CPU and a graphics processing unit (GPU). Since...
145
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
195
click to vote
ACAL
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
179
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper we present a method for fast surface reconstruction from large noisy datasets. Given an unorganized 3D point cloud, our algorithm recreates the underlying surface...