Sciweavers

5948 search results - page 390 / 1190
» Computing Robust Counter-Strategies
Sort
View
PR
2011
15 years 2 days ago
Linearized proximal alternating minimization algorithm for motion deblurring by nonlocal regularization
Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurrin...
Sangwoon Yun, Hyenkyun Woo
JDCTA
2010
182views more  JDCTA 2010»
14 years 12 months ago
Fusion Techniques for Reliable Information: A Survey
Information fused by multi-sensors is an important factor for obtaining reliable contextual information in smart spaces which use the pervasive and ubiquitous computing techniques...
Hyun Lee, Byoungyong Lee, Kyungseo Park, Ramez Elm...
PPL
2010
117views more  PPL 2010»
14 years 12 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
TOG
2010
111views more  TOG 2010»
14 years 11 months ago
Detail-preserving fully-Eulerian interface tracking framework
This paper introduces a fully-Eulerian interface tracking framework that preserves the fine details of liquids. Unlike existing Eulerian methods, the proposed framework shows good...
Nambin Heo, Hyeong-Seok Ko
SIAMSC
2011
148views more  SIAMSC 2011»
14 years 11 months ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...