A non-blocking global virtual time algorithm with logarithmic number of memory operations.
Mauro IanniRomolo MarottaAlessandro PellegriniFrancesco QuagliaPublished in: DS-RT (2017)
Keyphrases
- computational complexity
- memory requirements
- computational effort
- worst case
- experimental evaluation
- detection algorithm
- dynamic programming
- theoretical analysis
- improved algorithm
- computationally efficient
- cost function
- recognition algorithm
- matching algorithm
- linear programming
- memory space
- learning algorithm
- optimization algorithm
- tree structure
- times faster
- convergence rate
- memory usage
- particle swarm optimization
- small number
- computational cost
- np hard
- k means
- preprocessing
- randomized algorithm
- execution times
- single scan
- cluster centers
- space complexity
- segmentation algorithm
- input data
- high accuracy
- video sequences
- optimal solution