4843 search results - page 380 / 969 » The Shortcut Problem - Complexity and Approximation |
136
Voted
ESSMAC
2003
Springer
15 years 9 months ago
2003
Springer
We apply a constrained Hidden Markov Model architecture to the problem of simultaneous localization and surveying from sensor logs of mobile agents navigating in unknown environmen...
158
click to vote
IMR
2003
Springer
15 years 9 months ago
2003
Springer
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
148
click to vote
ICRA
1998
IEEE
15 years 8 months ago
1998
IEEE
: In this paper we present novel algorithms to compute quasi-static and dynamic equilibrium positions and orientations (if any) of 2D polygonal or curved parts placed on general sh...
136
click to vote
CVPR
1996
IEEE
15 years 8 months ago
1996
IEEE
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
151
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...