Sciweavers

613 search results - page 36 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
120
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
104
Voted
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 2 months ago
LSMR: An iterative algorithm for sparse least-squares problems
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
David Fong, Michael Saunders
ICCV
2011
IEEE
14 years 2 months ago
Tight Convex Relaxations for Vector-Valued Labeling Problems
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
Evgeny Strekalovskiy, Bastian Goldluecke, Daniel C...
SBACPAD
2003
IEEE
106views Hardware» more  SBACPAD 2003»
15 years 7 months ago
A Parallel Implementation of the LTSn Method for a Radiative Transfer Problem
— A radiative transfer solver that implements the LTSn method was optimized and parallelized using the MPI message passing communication library. Timing and profiling informatio...
Roberto P. Souto, Haroldo F. de Campos Velho, Step...
127
Voted
SCAI
2008
15 years 4 months ago
Towards Automatic Model Generation by Optimization
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
Per Nyblom, Patrick Doherty