Sciweavers

5215 search results - page 45 / 1043
» Quantum clustering algorithms
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
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 ...
Adrian G. Bors, Nikolaos Nasios
ISPD
2010
ACM
157views Hardware» more  ISPD 2010»
15 years 4 months ago
SafeChoice: a novel clustering algorithm for wirelength-driven placement
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...
Jackey Z. Yan, Chris Chu, Wai-Kei Mak
JC
2007
94views more  JC 2007»
14 years 9 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
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...
A. Papageorgiou
CSIE
2009
IEEE
15 years 4 months ago
Evaluating Clustering Algorithms: Cluster Quality and Feature Selection in Content-Based Image Clustering
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...
Mesfin Sileshi, Björn Gambäck
ICONIP
2008
14 years 11 months ago
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
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...
Tina Geweniger, Frank-Michael Schleif, Alexander H...