2219 search results - page 375 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
116
Voted
CCCG
1994
15 years 3 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
119
Voted
TASE
2008
IEEE
15 years 2 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
160
click to vote
WISES
2003
15 years 3 months ago
2003
The purpose of our on going research would be to track entities, which enter their field of vision over the sensor network. Based on their sightings, they maintain a dynamic cache ...
DAC
2004
ACM
16 years 3 months ago
2004
ACM
Scratch-pad memories (SPMs) enable fast access to time-critical data. While prior research studied both static and dynamic SPM management strategies, not being able to keep all ho...
112
click to vote
FAW
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...