1127 search results - page 2 / 226 » New Algorithms for Generalized Network Flows |
QOSIP
2005
Springer
14 years 28 days ago
2005
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
IPCO
1998
13 years 8 months ago
1998
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
IJAR
2010
13 years 5 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...