5215 search results - page 45 / 1043 » Quantum clustering algorithms |
113
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
ISPD
2010
ACM
15 years 7 months ago
2010
ACM
This paper presents SafeChoice (SC), a novel clustering algorithm for wirelength-driven placement. Unlike all previous approaches, SC is proposed based on a fundamental theorem, s...
102
click to vote
JC
2007
15 years 12 days ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
123
Voted
CSIE
2009
IEEE
15 years 7 months ago
2009
IEEE
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical...
122
Voted
ICONIP
2008
15 years 1 months ago
2008
In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kol...