A parametrized algorithm that implements sequential, causal, and cache memory consistencies.
Ernesto JiménezAntonio FernándezVicent CholviPublished in: J. Syst. Softw. (2008)
Keyphrases
- detection algorithm
- memory requirements
- memory usage
- computational complexity
- preprocessing
- dynamic programming
- learning algorithm
- k means
- experimental evaluation
- high accuracy
- optimal solution
- optimization algorithm
- binary trees
- convergence rate
- matching algorithm
- tree structure
- worst case
- probabilistic model
- computational cost
- np hard
- search space
- hit rate
- memory space
- non binary
- response time
- parallel implementation
- space complexity
- recognition algorithm
- associative memory
- cost function
- objective function
- bayesian networks