A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
Yuval FilmusJustin WardPublished in: CoRR (2012)
Keyphrases
- worst case
- objective function
- experimental evaluation
- detection algorithm
- learning algorithm
- computationally efficient
- computational cost
- cost function
- k means
- computational complexity
- times faster
- preprocessing
- greedy algorithm
- expectation maximization
- segmentation algorithm
- theoretical analysis
- recognition algorithm
- dynamic programming
- simulated annealing
- np hard
- classification algorithm
- matching algorithm
- lower bound
- similarity measure
- image sequences