217 search results - page 7 / 44 » Approximating Minimum Manhattan Networks |
139
click to vote
JCO
2008
15 years 2 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
112
Voted
SIAMCOMP
1998
15 years 2 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
118
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
116
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper we describe a method for Minimum Bayes Risk decoding for speech recognition. This is a technique similar to Consensus a.k.a. Confusion Network Decoding, in which we ...
107
click to vote
UAI
1994
15 years 3 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....