3894 search results - page 30 / 779 » Approximation Algorithms for Biclustering Problems |
4OR
2008
14 years 12 months ago
2008
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
UAI
1994
15 years 1 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....
JCO
2008
14 years 11 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
110
click to vote
COMPUTING
2008
14 years 12 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...