Sciweavers

661 search results - page 127 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
P2P
2009
IEEE
126views Communications» more  P2P 2009»
14 years 2 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...
LCN
2007
IEEE
14 years 1 months ago
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses
Abstract—We introduce a game-theoretic framework for reasoning about bandwidth attacks, a common form of distributed denial of service (DDoS) attacks. In particular, our traffic...
Mark E. Snyder, Ravi Sundaram, Mayur Thakur
MMMACNS
2005
Springer
14 years 26 days ago
Unique User-Generated Digital Pseudonyms
Abstract. This paper presents a method to generate unique and nevertheless highly random pseudonyms in a distributed environment. More precisely, each user can now generate his pse...
Peter Schartner, Martin Schaffer
SDM
2007
SIAM
73views Data Mining» more  SDM 2007»
13 years 8 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei
AUTOMATICA
2006
140views more  AUTOMATICA 2006»
13 years 7 months ago
On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...