828 search results - page 127 / 166 » Bounded Hairpin Completion |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In mobile ad hoc networks (MANET), nodes usually belong to different authorities and pursue different goals. In order to maximize their own performance, nodes in such networks ten...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
CVIU
2008
13 years 10 months ago
2008
This paper presents a scalable solution to the problem of tracking objects across spatially separated, uncalibrated cameras with non overlapping fields of view. The approach relie...