Sciweavers

224 search results - page 36 / 45
» Auctions with Severely Bounded Communication
Sort
View
IMC
2010
ACM
13 years 6 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 3 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi
MASS
2010
159views Communications» more  MASS 2010»
13 years 3 months ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia
TWC
2010
13 years 3 months ago
Relay selection and power allocation in cooperative cellular networks
We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sugge...
Sachin Kadloor, Raviraj Adve
MOBIHOC
2004
ACM
14 years 8 months ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li