Sciweavers

162 search results - page 4 / 33
» A Relational Approach to the Compilation of Sparse Matrix Pr...
Sort
View
ICML
2010
IEEE
13 years 7 months ago
A DC Programming Approach for Sparse Eigenvalue Problem
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An
JMLR
2012
11 years 10 months ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao
IEEEPACT
2009
IEEE
14 years 2 months ago
Chainsaw: Using Binary Matching for Relative Instruction Mix Comparison
With advances in hardware, instruction set architectures are undergoing continual evolution. As a result, compilers are under constant pressure to adapt and take full advantage of...
Tipp Moseley, Dirk Grunwald, Ramesh Peri
IEEEPACT
1998
IEEE
13 years 11 months ago
A Matrix-Based Approach to the Global Locality Optimization Problem
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Stable Principal Component Pursuit
In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a highdimensional data matrix despite both small entry-wise noise and gross spar...
Zihan Zhou, Xiaodong Li, John Wright, Emmanuel J. ...