1729 search results - page 261 / 346 » Bound Graph Polysemy |
139
click to vote
INFOCOM
2009
IEEE
15 years 11 months 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 ...
154
click to vote
AINA
2007
IEEE
15 years 11 months 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...
162
click to vote
SECON
2007
IEEE
15 years 11 months 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...
129
click to vote
CPAIOR
2007
Springer
15 years 11 months 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...
150
click to vote
MFCS
2007
Springer
15 years 11 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...