Sciweavers

23 search results - page 1 / 5
» Exact Algorithms for NP-Hard Problems: A Survey
Sort
View
AUSSOIS
2001
Springer
13 years 9 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
NIPS
2007
13 years 6 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ATAL
2009
Springer
13 years 11 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
14 years 11 months ago
Sparse Subspace Clustering
We propose a method based on sparse representation (SR) to cluster data drawn from multiple low-dimensional linear or affine subspaces embedded in a high-dimensional space. Our ...
Ehsan Elhamifar, René Vidal
DFG
2009
Springer
13 years 11 months ago
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
Jiong Guo, Hannes Moser, Rolf Niedermeier