Sciweavers

1265 search results - page 210 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
ITNG
2008
IEEE
14 years 2 months ago
An Efficient Technique for Distance Computation in Road Networks
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 8 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
ADHOC
2008
95views more  ADHOC 2008»
13 years 7 months ago
The polarized gossip protocol for path discovery in MANETs
In this paper we present a novel probabilistic protocol for path discovery in Mobile Ad Hoc Networks (MANETs). The protocol implements what we call a polarized gossiping algorithm...
Roberto Beraldi
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 9 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
WCNC
2008
IEEE
14 years 2 months ago
A Closed-Form Approximation for Capacity of Multiuser MIMO Broadcast Systems: A Virtual User Approach
— Besides delivering high data rates in a point-to-point scenario, multi-input multi-output (MIMO) antenna techniques can broadcast personalized data to multiple users in the poi...
Li-Chun Wang, Chu-Jung Yeh, Chi-Fang Li