Sciweavers

70 search results - page 2 / 14
» Improving locality of nonserial polyadic dynamic programming
Sort
View
CVPR
2006
IEEE
15 years 26 days ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
Marc-Antoine Drouin, Martin Trudeau, Sébast...
CRV
2008
IEEE
205views Robotics» more  CRV 2008»
14 years 5 months ago
Accurate Boundary Localization using Dynamic Programming on Snakes
The extraction of contours using deformable models, such as snakes, is a problem of great interest in computer vision, particular in areas of medical imaging and tracking. Snakes ...
Akshaya Kumar Mishra, Paul W. Fieguth, David A. Cl...
KR
2004
Springer
14 years 4 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
IPPS
1999
IEEE
14 years 3 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
EUC
2006
Springer
14 years 2 months ago
Data-Layout Optimization Using Reuse Distance Distribution
As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture system...
Xiong Fu, Yu Zhang, Yiyun Chen