Sciweavers

706 search results - page 4 / 142
» Super Solutions in Constraint Programming
Sort
View
PARA
1995
Springer
14 years 2 months ago
Decomposing Linear Programs for Parallel Solution
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
Ali Pinar, Ümit V. Çatalyürek, Ce...
MVA
2007
160views Computer Vision» more  MVA 2007»
14 years 8 days ago
Probabilistic Motion Segmentation of Videos for Temporal Super Resolution
A novel scheme is proposed for achieving motion segmentation in low-frame rate videos, with application to temporal super resolution. Probabilistic generative models are commonly ...
Arasanathan Thayananthan, Masahiro Iwasaki, Robert...
ISQED
2003
IEEE
215views Hardware» more  ISQED 2003»
14 years 4 months ago
Low-Cost and Real-Time Super-Resolution over a Video Encoder IP
This paper addresses a low-cost and real-time solution for the implementation of super-resolution (SR) algorithms over SOC (System-On-Chip) platforms in order to achieve high-qual...
Gustavo Marrero Callicó, Antonio Nú&...
TIP
2010
155views more  TIP 2010»
13 years 5 months ago
Multiframe Super-Resolution Reconstruction of Small Moving Objects
Multiframe super-resolution (SR) reconstruction of small moving objects against a cluttered background is difficult for two reasons: a small object consists completely of "mix...
Adam W. M. van Eekeren, Klamer Schutte, Lucas J. v...
CP
2007
Springer
14 years 5 months ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant