Sciweavers

1388 search results - page 45 / 278
» Approximability of Robust Network Design
Sort
View
JCSS
2010
146views more  JCSS 2010»
13 years 6 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
HOTOS
2007
IEEE
13 years 11 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
ADHOC
2008
96views more  ADHOC 2008»
13 years 7 months ago
Network configuration for optimal utilization efficiency of wireless sensor networks
This paper addresses the problem of configuring wireless sensor networks (WSNs). Specifically, we seek answers to the following questions: how many sensors should be deployed, wha...
Yunxia Chen, Chen-Nee Chuah, Qing Zhao
ASYNC
1998
IEEE
71views Hardware» more  ASYNC 1998»
13 years 12 months ago
Towards Asynchronous A-D Conversion
Analogue to digital (A-D) converters with a xed conversion time are subject to errors due to metastability. These errors will occur in all converter designs with a bounded time fo...
D. J. Kinniment, Alexandre Yakovlev, Fei Xia, B. G...
MOBICOM
2004
ACM
14 years 1 months ago
Practical robust localization over large-scale 802.11 wireless networks
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
Andreas Haeberlen, Eliot Flannery, Andrew M. Ladd,...