Sciweavers

5096 search results - page 462 / 1020
» Landscape of Clustering Algorithms
Sort
View
PR
2010
156views more  PR 2010»
15 years 5 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier
BIBE
2010
IEEE
148views Bioinformatics» more  BIBE 2010»
15 years 1 months ago
Prediction of Gene Ontology Annotations Based on Gene Functional Clustering
We propose an algorithm that predicts potentially missing Gene Ontology annotations, in order to speed up the time-consuming annotation curation process. The proposed method extend...
Marco Tagliasacchi, Roberto Sarati, Marco Masserol...
173
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Artificial bandwidth extension of spectral envelope with temporal clustering
We present a new wideband spectral envelope estimation framework for the artificial bandwidth extension problem. The proposed framework builds temporal clusters of the joint sub-...
Can Yagli, Engin Erzin
219
Voted
CVPR
2012
IEEE
13 years 9 months ago
Group action induced distances for averaging and clustering Linear Dynamical Systems with applications to the analysis of dynami
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
Bijan Afsari, Rizwan Chaudhry, Avinash Ravichandra...
IJFCS
2006
63views more  IJFCS 2006»
15 years 6 months ago
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
Mourad Hakem, Franck Butelle