Three Versions of a Minimal Storage Cholesky Algorithm Using New Data Structures Gives High Performance Speeds as Verified on Many Computers.
Jerzy WasniewskiFred G. GustavsonPublished in: PPAM (2007)
Keyphrases
- data structure
- significant improvement
- improved algorithm
- dynamic programming
- detection algorithm
- objective function
- experimental evaluation
- times faster
- learning algorithm
- optimization algorithm
- segmentation algorithm
- computationally efficient
- expectation maximization
- simulated annealing
- worst case
- k means
- memory requirements
- probabilistic model
- computational cost
- cost function
- theoretical analysis
- genetic algorithm
- high efficiency
- matching algorithm
- computer systems
- high accuracy
- np hard
- computational complexity