A log-space algorithm for reachability in planar DAGs with few sources.
Derrick StoleeChris BourkeN. V. VinodchandranPublished in: Electron. Colloquium Comput. Complex. (2009)
Keyphrases
- learning algorithm
- computational complexity
- experimental evaluation
- times faster
- high accuracy
- dynamic programming
- cost function
- segmentation algorithm
- optimization algorithm
- objective function
- higher dimensional
- np hard
- search space
- computational cost
- probabilistic model
- k means
- simulated annealing
- theoretical analysis
- optimal solution
- convex hull
- camera calibration
- neural network
- significant improvement