Analyzing Shortest and Fastest Paths with GIS and Determining Algorithm Running Time.
Turan ErdenMehmet Zeki CoskunPublished in: VISUAL (2005)
Keyphrases
- times faster
- learning algorithm
- cost function
- theoretical analysis
- computationally efficient
- optimal solution
- dynamic programming
- memory requirements
- computational complexity
- search space
- experimental evaluation
- np hard
- particle swarm optimization
- simulated annealing
- expectation maximization
- optimization algorithm
- detection algorithm
- classification algorithm
- convergence rate
- selection algorithm
- improved algorithm
- worst case
- computational cost
- k means
- image segmentation
- similarity measure
- artificial neural networks
- preprocessing
- clustering method
- neural network
- geographic information systems
- image processing
- recognition algorithm
- convex hull
- linear programming
- shortest path
- significant improvement
- segmentation algorithm
- probabilistic model
- databases