Sciweavers

573 search results - page 28 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
ICIP
2008
IEEE
14 years 10 months ago
Face hallucination VIA sparse coding
In this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the fa...
Jianchao Yang, Hao Tang, Yi Ma, Thomas S. Huang
CVPR
2009
IEEE
14 years 27 days ago
Efficiently training a better visual detector with sparse eigenvectors
Face detection plays an important role in many vision applications. Since Viola and Jones [1] proposed the first real-time AdaBoost based object detection system, much effort has ...
Sakrapee Paisitkriangkrai, Chunhua Shen, Jian Zhan...
IPPS
2005
IEEE
14 years 2 months ago
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...
Jacques M. Bahi, Raphaël Couturier
SC
2009
ACM
14 years 3 months ago
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations enc...
Nathan Bell, Michael Garland
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 9 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev