Sciweavers

7228 search results - page 68 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 11 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
SIGMETRICS
2004
ACM
107views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
On zone-balancing of peer-to-peer networks: analysis of random node join
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
Xiaoming Wang, Yueping Zhang, Xiafeng Li, Dmitri L...
SASN
2006
ACM
15 years 3 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
ICASSP
2009
IEEE
15 years 4 months ago
Estimating multiple transmitter locations from power measurements at multiple receivers
We consider the estimation of the locations of multiple transmitters based on received signal strength measurements at a network of randomly-placed receivers. We generalize the ex...
Jill K. Nelson, Jaime E. Almodovar, Maya R. Gupta,...
TIT
1998
90views more  TIT 1998»
14 years 9 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...