Sciweavers

4889 search results - page 283 / 978
» A Refactoring Approach to Parallelism
Sort
View
JGO
2010
89views more  JGO 2010»
15 years 2 months ago
Iterative regularization algorithms for constrained image deblurring on graphics processors
Abstract The ability of the modern graphics processors to operate on large matrices in parallel can be exploited for solving constrained image deblurring problems in a short time. ...
Valeria Ruggiero, Thomas Serafini, Riccardo Zanell...
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 28 days ago
Joint space and workspace analysis of a two-DOF closed-chain manipulator
: The aim of this paper is to compute of the generalized aspects, i.e. the maximal singularity-free domains in the Cartesian product of the joint space and workspace, for a planar ...
Damien Chablat
CVPR
2009
IEEE
16 years 11 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
ICIP
2008
IEEE
15 years 10 months ago
Localized and computationally efficient approach to shift-variant image deblurring
A new localized and computationally efficient approach is presented for shift/space-variant image restoration. Unlike conventional approaches, it models shift-variant blurring in...
Murali Subbarao, Youn-sik Kang, Satyaki Dutta, Xue...
IEEEPACT
2005
IEEE
15 years 9 months ago
Memory Coloring: A Compiler Approach for Scratchpad Memory Management
Scratchpad memory (SPM), a fast software-managed onchip SRAM, is now widely used in modern embedded processors. Compared to hardware-managed cache, it is more efficient in perfor...
Lian Li 0002, Lin Gao 0002, Jingling Xue