Sciweavers

5096 search results - page 679 / 1020
» Landscape of Clustering Algorithms
Sort
View
IDEAL
2007
Springer
16 years 28 days ago
A Framework to Analyze Biclustering Results on Microarray Experiments
Microarray technology produces large amounts of information to be manipulated by analysis methods, such as biclustering algorithms, to extract new knowledge. All-purpose multivaria...
Rodrigo Santamaría, Roberto Therón, ...
PPAM
2007
Springer
16 years 27 days ago
A Block-Based Parallel Adaptive Scheme for Solving the 4D Vlasov Equation
We present a parallel algorithm for solving the 4D Vlasov equation. Our algorithm is designed for distributed memory architectures. It uses an adaptive numerical method which reduc...
Olivier Hoenen, Eric Violard
ICDM
2005
IEEE
133views Data Mining» more  ICDM 2005»
16 years 12 days ago
Summarization - Compressing Data into an Informative Representation
In this paper, we formulate the problem of summarization of a dataset of transactions with categorical attributes as an optimization problem involving two objective functions - co...
Varun Chandola, Vipin Kumar
EMSOFT
2005
Springer
16 years 10 days ago
A GA-based scheduling method for FlexRay systems
An advanced communication system, the FlexRay system, has been developed for future automotive applications. It consists of time-triggered clusters, such as drive-by-wire in cars,...
Shan Ding, Naohiko Murakami, Hiroyuki Tomiyama, Hi...
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 9 days ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...