7150 search results - page 123 / 1430 » An Approximation Algorithm for Approximation Rank |
132
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
136
click to vote
ISAAC
1998
Springer
15 years 6 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
131
Voted
FSTTCS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
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....
127
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...