Sciweavers

2137 search results - page 62 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICPP
1999
IEEE
13 years 12 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
IDA
2003
Springer
14 years 25 days ago
Fuzzy Clustering of Short Time-Series and Unevenly Distributed Sampling Points
This paper proposes a new clustering algorithm in the fuzzy-c-means family, which is designed to cluster time series and is particularly suited for short time series and those wit...
Carla S. Möller-Levet, Frank Klawonn, Kwang-H...
WABI
2007
Springer
14 years 1 months ago
A Graph Clustering Approach to Weak Motif Recognition
The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA ...
Christina Boucher, Daniel G. Brown, Paul Church
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
14 years 1 months ago
Clustering with Niching Genetic K-means Algorithm
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
Weiguo Sheng, Allan Tucker, Xiaohui Liu
ICPR
2008
IEEE
14 years 2 months ago
Multi-stage branch-and-bound for maximum variance disparity clustering
A split-and-merge framework based on a maximum variance criterion is proposed for disparity clustering. The proposed algorithm transforms low-level stereo disparity information to...
Ninad Thakoor, Venkat Devarajan, Jean Gao