Sciweavers

187 search results - page 17 / 38
» Generic Graph Algorithms for Sparse Matrix Ordering
Sort
View
ISPASS
2009
IEEE
15 years 4 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
CORR
2010
Springer
93views Education» more  CORR 2010»
14 years 9 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
CORR
2012
Springer
195views Education» more  CORR 2012»
13 years 5 months ago
Ranking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
Michele Benzi, Ernesto Estrada, Christine Klymko
SIAMSC
2008
131views more  SIAMSC 2008»
14 years 9 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
FGR
2006
IEEE
147views Biometrics» more  FGR 2006»
15 years 3 months ago
Learning Sparse Features in Granular Space for Multi-View Face Detection
In this paper, a novel sparse feature set is introduced into the Adaboost learning framework for multi-view face detection (MVFD), and a learning algorithm based on heuristic sear...
Chang Huang, Haizhou Ai, Yuan Li, Shihong Lao