Sciweavers

342 search results - page 51 / 69
» Matrix algebra and applicative programming
Sort
View
155
Voted
ISPAN
2002
IEEE
15 years 6 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
JACM
2011
152views more  JACM 2011»
14 years 4 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
SC
2000
ACM
15 years 6 months ago
Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...
Ray S. Tuminaro, Charles Tong
BMCBI
2010
135views more  BMCBI 2010»
15 years 2 months ago
Quadratic variance models for adaptively preprocessing SELDI-TOF mass spectrometry data
Background: Surface enhanced laser desorption/ionization time-of-flight mass spectrometry (SELDI) is a proteomics tool for biomarker discovery and other high throughput applicatio...
Vincent A. Emanuele II, Brian M. Gurbaxani
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
16 years 2 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...