273 search results - page 9 / 55 » Can Pure Cutting Plane Algorithms Work |
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— A new strategy is developed for tracking an odor plume in an environment where wind is present. The strategy is inspired by the mechanisms that animals use to orient to stimuli...
SGP
2007
13 years 10 months ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
MP
2002
13 years 7 months ago
2002
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...