Sciweavers

294 search results - page 3 / 59
» Interaction with the Reorderable Matrix
Sort
View
BMCBI
2008
166views more  BMCBI 2008»
13 years 6 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
PPSC
1997
13 years 7 months ago
Improving Memory-System Performance of Sparse Matrix-Vector Multiplication
Sparse matrix-vector multiplication is an important kernel that often runs inefficiently on superscalar RISC processors. This paper describes techniques that increase instruction-...
Sivan Toledo
DAC
2005
ACM
14 years 7 months ago
ICCAP: a linear time sparse transformation and reordering algorithm for 3D BEM capacitance extraction
This paper presents an efficient hierarchical 3D capacitance extraction algorithm -- ICCAP. Most previous capacitance extraction algorithms introduce intermediate variables to fac...
Rong Jiang, Yi-Hao Chang, Charlie Chung-Ping Chen
GLOBECOM
2008
IEEE
14 years 22 days ago
A Maximum-Likelihood Decoder with a New Reduction Strategy for MIMO Channel Systems
—An efficient maximum-likelihood decoder with a new reduction strategy is proposed for linear MIMO channel systems. Unlike the current reduction strategies which only reorder th...
Xiao-Wen Chang, Xiaohua Yang
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 1 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...