1729 search results - page 275 / 346 » On Bounds for the k-Partitioning of Graphs |
155
click to vote
ICC
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
157
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
173
click to vote
AINA
2007
IEEE
16 years 16 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
183
click to vote
SECON
2007
IEEE
16 years 14 days ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
144
click to vote
CPAIOR
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...