1760 search results - page 6 / 352 » Connected Set Cover Problem and Its Applications |
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
MP
2007
13 years 7 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
ISCC
2005
IEEE
2005
IEEE
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
14 years 1 months ago
— Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the networ...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...