Sciweavers

1370 search results - page 265 / 274
» On grids in topological graphs
Sort
View
SPAA
2009
ACM
16 years 25 days ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
16 years 21 days ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
INFOCOM
2009
IEEE
16 years 21 days ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
ALGOSENSORS
2009
Springer
16 years 20 days ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
IMC
2009
ACM
16 years 17 days ago
Characterizing user behavior in online social networks
Understanding how users behave when they connect to social networking sites creates opportunities for better interface design, richer studies of social interactions, and improved ...
Fabrício Benevenuto, Tiago Rodrigues, Meeyo...