Sciweavers

2192 search results - page 65 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CASES
2003
ACM
14 years 1 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara
CVPR
2004
IEEE
14 years 10 months ago
Multibody Factorization with Uncertainty and Missing Data Using the EM Algorithm
Multibody factorization algorithms [2, 1, 16] give an elegant and simple solution to the problem of structure from motion even for scenes containing multiple independent motions. ...
Amit Gruber, Yair Weiss
SIAMSC
2010
194views more  SIAMSC 2010»
13 years 6 months ago
A Multilevel Algorithm for Simultaneously Denoising and Deblurring Images
In this paper, we develop a fast multilevel algorithm for simultaneously denoising and deblurring images under the total variation regularization. Although much effort has been de...
Raymond H. Chan, Ke Chen 0002
ICCS
2009
Springer
14 years 2 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
JPDC
2006
111views more  JPDC 2006»
13 years 8 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader