Sciweavers

1265 search results - page 190 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
127
Voted
MP
1998
109views more  MP 1998»
15 years 2 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
178
Voted
MOBIHOC
2005
ACM
16 years 2 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana
136
Voted
CCS
2009
ACM
15 years 9 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
130
Voted
SOCIALCOM
2010
15 years 14 days ago
Estimating the Size of Online Social Networks
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
Shaozhi Ye, Shyhtsun Felix Wu
120
Voted
TPDS
2008
136views more  TPDS 2008»
15 years 2 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...