Sciweavers

777 search results - page 151 / 156
» A fast algorithm for the computation of an upper bound on th...
Sort
View
TPDS
2008
157views more  TPDS 2008»
13 years 8 months ago
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire...
Bin Xiao, Hekang Chen, Shuigeng Zhou
SIAMMAX
2010
224views more  SIAMMAX 2010»
13 years 3 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
IMC
2009
ACM
14 years 3 months ago
TCP revisited: a fresh look at TCP in the wild
Since the last in-depth studies of measured TCP traffic some 68 years ago, the Internet has experienced significant changes, including the rapid deployment of backbone links wit...
Feng Qian, Alexandre Gerber, Zhuoqing Morley Mao, ...
SP
2006
IEEE
100views Security Privacy» more  SP 2006»
14 years 2 months ago
Fundamental Limits on the Anonymity Provided by the MIX Technique
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...
Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Di...
MOBIHOC
2004
ACM
14 years 2 months ago
Market sharing games applied to content distribution in ad-hoc networks
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...
Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni,...