Contributors; Introduction Lucas Bordeaux, Youssef Hamadi and Pushmeet Kohli; Part I. Graphical Structure: 1. Treewidth and hypertree width Georg Gottlob, Gianluigi Greco and Francesco Scarcello; 2. Perfect graphs and graphical modeling Tony Jebara; Part II. Language Restrictions: 3. Submodular function maximization Andreas Krause and Daniel Golovin; 4. Tractable valued constraints Peter G. Jeavons and Stanislav ivný; 5. Tractable knowledge representation formalisms Adnan Darwiche; Part III. Algorithms and their Analysis: 6. Tree-reweighted message passing Vladimir Kolmogorov; 7. Tractable optimization in machine learning Suvrit Sra; 8. Approximation algorithms Mohit Singh and Kunal Talwar; 9. Kernelization methods for fixed-parameter tractability Fedor V. Fomin and Saket Saurabh; Part IV. Tractability in Some Specific Areas: 10. Efficient submodular function minimization for computer vision Pushmeet Kohli; 11. Towards practical graph-based, iteratively decoded channel codes: insights through absorbing sets Lara Dolecek; Part V. Heuristics: 12. SAT solvers Joao Marques-Silva and Ines Lynce; 13. Tractability and modern satisfiability modulo theories solvers Nikolaj Bjørner and Leonardo de Moura.
Contributors; Introduction Lucas Bordeaux, Youssef Hamadi and Pushmeet Kohli; Part I. Graphical Structure: 1. Treewidth and hypertree width Georg Gottlob, Gianluigi Greco and Francesco Scarcello; 2. Perfect graphs and graphical modeling Tony Jebara; Part II. Language Restrictions: 3. Submodular function maximization Andreas Krause and Daniel Golovin; 4. Tractable valued constraints Peter G. Jeavons and Stanislav ivný; 5. Tractable knowledge representation formalisms Adnan Darwiche; Part III. Algorithms and their Analysis: 6. Tree-reweighted message passing Vladimir Kolmogorov; 7. Tractable optimization in machine learning Suvrit Sra; 8. Approximation algorithms Mohit Singh and Kunal Talwar; 9. Kernelization methods for fixed-parameter tractability Fedor V. Fomin and Saket Saurabh; Part IV. Tractability in Some Specific Areas: 10. Efficient submodular function minimization for computer vision Pushmeet Kohli; 11. Towards practical graph-based, iteratively decoded channel codes: insights through absorbing sets Lara Dolecek; Part V. Heuristics: 12. SAT solvers Joao Marques-Silva and Ines Lynce; 13. Tractability and modern satisfiability modulo theories solvers Nikolaj Bjørner and Leonardo de Moura.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
