On the Complexity and Performance of the Information Dispersal Algorithm.
Ricardo Marcelín-JiménezJorge L. Ramirez-OrtizEnrique Rodríguez-ColinaMichael Pascoe-ChalkeJosé Luis GonzálezPublished in: IEEE Access (2020)
Keyphrases
- computational complexity
- final result
- space complexity
- detection algorithm
- computational cost
- experimental evaluation
- information sources
- high accuracy
- learning algorithm
- significant improvement
- worst case
- gradient information
- classification algorithm
- theoretical analysis
- probabilistic model
- preprocessing
- optimal solution
- cost function
- image segmentation
- high computational complexity
- objective function
- memory requirements
- times faster
- matching algorithm
- lower bound
- k means
- prior knowledge
- dynamic programming
- ant colony optimization
- clustering method
- recommender systems
- input data
- improved algorithm
- similarity measure