1486 search results - page 78 / 298 » Algorithms for two-box covering |
166
click to vote
HOTNETS
2010
15 years 1 months ago
2010
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
230
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
164
click to vote
INFOCOM
2007
IEEE
16 years 16 days ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
186
click to vote
NIPS
2001
15 years 7 months ago
2001
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
153
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...