2254 search results - page 147 / 451 » Computing the minimal covering set |
167
click to vote
EOR
2007
15 years 6 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
164
click to vote
ICMCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Minimizing the number of computations a low-power device makes is important to achieve long battery life. In this paper we present a framework for a low-power device to minimize t...
192
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
A new method for localising and recognising hand poses and objects in real-time is presented. This problem is important in vision-driven applications where it is natural for a use...
179
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Active contours is a popular technique for image segmentation.
However, active contour tend to converge to the
closest local minimum of its energy function and often requires
a ...
161
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...