Sciweavers

1802 search results - page 200 / 361
» Sparse Computations with PEI
Sort
View
PLDI
2003
ACM
15 years 9 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
15 years 8 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
NETWORKING
2010
15 years 6 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
182
Voted
BMCBI
2010
216views more  BMCBI 2010»
14 years 11 months ago
Bayesian Inference of the Number of Factors in Gene-Expression Analysis: Application to Human Virus Challenge Studies
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
Bo Chen, Minhua Chen, John William Paisley, Aimee ...
SIAMMAX
2010
224views more  SIAMMAX 2010»
14 years 11 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu