Sciweavers

377 search results - page 45 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
DAC
2005
ACM
14 years 9 months ago
Fault and energy-aware communication mapping with guaranteed latency for applications implemented on NoC
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival prob...
Sorin Manolache, Petru Eles, Zebo Peng
CVPR
2000
IEEE
14 years 10 months ago
Improved Motion Stereo Matching Based on a Modified Dynamic Programming
A new method for computing precise depth map estimates of 3D shape of a moving object is proposed. 3D shape recovery in motion stereo is formulated as a matching optimization prob...
Mikhail Mozerov, Vitaly Kober, Tae-Sun Choi
EOR
2010
119views more  EOR 2010»
13 years 8 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 2 months ago
Applying Logic Synthesis for Speeding Up SAT
SAT solvers are often challenged with very hard problems that remain unsolved after hours of CPU time. The research community meets the challenge in two ways: (1) by improving the ...
Niklas Eén, Alan Mishchenko, Niklas Sö...
SIGGRAPH
1997
ACM
14 years 25 days ago
Creating full view panoramic image mosaics and environment maps
This paper presents a novel approach to creating full view panoramic mosaics from image sequences. Unlike current panoramic stitching methods, which usually require pure horizonta...
Richard Szeliski, Heung-Yeung Shum