Sciweavers

248 search results - page 10 / 50
» Performance and stability bounds for dynamic networks
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
PODC
2010
ACM
15 years 1 months ago
Optimal gradient clock synchronization in dynamic networks
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rote...
ICOIN
2003
Springer
15 years 3 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid
IROS
2009
IEEE
147views Robotics» more  IROS 2009»
15 years 4 months ago
Dynamics morphing from regulator to oscillator on bipedal control
— A stable non-linear oscillator for autonomous biped stepping control is designed in a top-down manner by morphing dynamics of standing regulator. It resolves three problems whi...
Tomomichi Sugihara
TON
2008
69views more  TON 2008»
14 years 10 months ago
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...
Michael J. Neely