2487 search results - page 357 / 498 » Partitions of Graphs into Trees |
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
EMMCVPR
2007
Springer
14 years 2 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
MSN
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...