2536 search results - page 406 / 508 » Constructing Optimal Highways |
APPROX
2008
Springer
14 years 4 days ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
ASMTA
2008
Springer
14 years 4 days ago
2008
Springer
Ad hoc network routing protocols may fail to operate in the absence of an end-to-end connection from source to destination. This deficiency can be resolved by so-called delay-toler...
AUTONOMICS
2008
ACM
14 years 3 days ago
2008
ACM
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
COMPGEOM
2006
ACM
14 years 2 days ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
ALT
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. We consider the problem of sequence prediction in a probabilistic setting. Let there be given a class C of stochastic processes (probability measures on the set of one-wa...