1403 search results - page 21 / 281 » About Approximations of Exponentials |
WDAG
2007
Springer
15 years 5 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
80
Voted
ICRA
2005
IEEE
15 years 4 months ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
SIAMJO
2008
14 years 11 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
51
Voted
JSAC
2008
14 years 11 months ago
2008
In this paper, we present a single-carrier transceiver for rapidly time-varying channels, where the equalization step is implemented in the frequency domain. When the channel abide...
104
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...