Sciweavers

1941 search results - page 187 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
178
Voted
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
16 years 20 days ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
ICC
2008
IEEE
127views Communications» more  ICC 2008»
16 years 1 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
235
Voted
IPSN
2007
Springer
16 years 1 months ago
Probabilistic detection of mobile targets in heterogeneous sensor networks
Target detection and field surveillance are among the most prominent applications of Sensor Networks (SN). The quality of detection achieved by a SN can be quantified by evaluat...
Loukas Lazos, Radha Poovendran, James A. Ritcey
MOBIHOC
2008
ACM
16 years 6 months ago
Finding popular categories for RFID tags
As RFID tags are increasingly attached to everyday items, it quickly becomes impractical to collect data from every tag in order to extract useful information. In this paper, we c...
Bo Sheng, Chiu Chiang Tan, Qun Li, Weizhen Mao
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
15 years 5 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam