Sciweavers

398 search results - page 2 / 80
» A new biclustering technique based on crossing minimization
Sort
View
COCOA
2007
Springer
14 years 13 days ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim
IDA
2005
Springer
13 years 11 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
ICDCS
2006
IEEE
14 years 9 days ago
ParRescue: Scalable Parallel Algorithm and Implementation for Biclustering over Large Distributed Datasets
Biclustering refers to simultaneously capturing correlations present among subsets of attributes (columns) and records (rows). It is widely used in data mining applications includ...
Jianhong Zhou, Ashfaq A. Khokhar
CSB
2004
IEEE
173views Bioinformatics» more  CSB 2004»
13 years 10 months ago
Gene Ontology Friendly Biclustering of Expression Profiles
The soundness of clustering in the analysis of gene expression profiles and gene function prediction is based on the hypothesis that genes with similar expression profiles may imp...
Jinze Liu, Wei Wang 0010, Jiong Yang
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
13 years 12 months ago
Encoding-Based Minimization of Inductive Cross-Talk for Off-Chip Data Transmission
Inductive cross-talk within IC packaging is becoming a significant bottleneck in high-speed inter-chip communication. The parasitic inductance within IC packaging causes bounce o...
Brock J. LaMeres, Sunil P. Khatri