A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two.
Serdar Süer ErdemÇetin Kaya KoçPublished in: IEEE Symposium on Computer Arithmetic (2003)
Keyphrases
- experimental evaluation
- detection algorithm
- dynamic programming
- computational complexity
- search space
- times faster
- optimal solution
- k means
- computationally efficient
- cost function
- computational cost
- classification algorithm
- worst case
- np hard
- preprocessing
- probabilistic model
- fixed size
- input data
- significant improvement
- segmentation algorithm
- memory requirements
- linear programming
- space complexity
- estimation algorithm
- standard deviation
- recursive algorithm
- worst case time complexity
- matching algorithm
- ant colony optimization
- theoretical analysis
- expectation maximization
- data sets
- high accuracy
- objective function
- similarity measure