A Parameterized Algorithm for Packing Overlapping Subgraphs.
Jazmín RomeroAlejandro López-OrtizPublished in: CSR (2014)
Keyphrases
- experimental evaluation
- detection algorithm
- significant improvement
- np hard
- times faster
- dynamic programming
- computational cost
- simulated annealing
- learning algorithm
- expectation maximization
- classification algorithm
- worst case
- motion estimation
- k means
- computational complexity
- high accuracy
- selection algorithm
- improved algorithm
- packing problem
- convergence rate
- convex hull
- clustering method
- objective function