72 search results - page 9 / 15 » Practical approximation algorithms for zero- and bounded-ske... |
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
69
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
119
click to vote
ISPD
1997
ACM
15 years 1 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
VTC
2006
IEEE
15 years 3 months ago
2006
IEEE
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
63
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...