642 search results - page 108 / 129 » Approximation Algorithms for Minimum K-Cut |
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
ICIP
1999
IEEE
14 years 1 months ago
1999
IEEE
Optical diffusion tomography attempts to reconstruct an object cross section from measurements of scattered and attenuated light. While Bayesian approaches are well suited to this...
COMGEO
2008
ACM
13 years 9 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
CEC
2011
IEEE
12 years 9 months ago
2011
IEEE
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...