315 search results - page 42 / 63 » An Optimal Algorithm for the Maximum-Density Segment Problem |
ICRA
2002
IEEE
14 years 9 days ago
2002
IEEE
It is well known that antipodal grasps can be achieved on curved objects in the presence of friction. This paper presents an efficient algorithm that finds, up to numerical reso...
WADS
2005
Springer
14 years 25 days ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
ISPD
1999
ACM
13 years 11 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
PAMI
2010
13 years 5 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...