2944 search results - page 194 / 589 » Improving Bound Propagation |
171
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
140
click to vote
DLT
2007
15 years 8 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
192
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
180
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper, we study how estimates of ego-motion based on feature tracking (visual odometry) can be improved using a rough (low accuracy) map of where the observer has been. We...
184
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...