The bitwise operations related to a fast sorting algorithm.
Krasimir YordzhevPublished in: CoRR (2013)
Keyphrases
- experimental evaluation
- detection algorithm
- preprocessing
- computational cost
- single pass
- optimization algorithm
- times faster
- improved algorithm
- learning algorithm
- dynamic programming
- significant improvement
- optimal solution
- cost function
- high accuracy
- k means
- recognition algorithm
- boolean operations
- tree structure
- hamming distance
- memory requirements
- simulated annealing
- path planning
- theoretical analysis
- linear programming
- worst case
- np hard
- decision trees