1632 search results - page 196 / 327 » Sublinear Time Algorithms for Metric Space Problems |
146
click to vote
ICCTA
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
134
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
165
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...
123
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
143
click to vote
IJRR
2002
15 years 4 months ago
2002
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...