4 search results - page 1 / 1 » Computing Representations of Matroids of Bounded Branch-Widt... |
STACS
2007
Springer
13 years 11 months ago
2007
Springer
For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
We show that, for every finite field , the class of all representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we p...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...