Sciweavers

331 search results - page 54 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
ICDCS
2007
IEEE
15 years 9 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
WINET
2008
86views more  WINET 2008»
15 years 3 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
NIPS
1996
15 years 4 months ago
Early Brain Damage
Optimal Brain Damage (OBD) is a method for reducing the number of weights in a neural network. OBD estimates the increase in cost function if weights are pruned and is a valid app...
Volker Tresp, Ralph Neuneier, Hans-Georg Zimmerman...
CISS
2008
IEEE
15 years 9 months ago
Relay selection methods for wireless cooperative communications
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
Seunghoon Nam, Mai Vu, Vahid Tarokh
WADS
2005
Springer
162views Algorithms» more  WADS 2005»
15 years 8 months ago
The Minimum-Area Spanning Tree Problem
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell