Sciweavers

125 search results - page 20 / 25
» Minimizing the Network Distance in Distributed Web Crawling
Sort
View
IDC
2009
Springer
13 years 5 months ago
Efficient Broadcasting by Selective Forwarding
A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solu...
Doina Bein, Ajoy Kumar Datta, Balaji Ashok Sathyan...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
21
Voted
TMC
2010
138views more  TMC 2010»
13 years 5 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
SPAA
2010
ACM
14 years 9 days ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
ICPP
1990
IEEE
13 years 11 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin