The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings.
Yao SunDingkang WangPublished in: ASCM (2009)
Keyphrases
- complexity analysis
- learning algorithm
- preprocessing
- theoretical analysis
- objective function
- detection algorithm
- high accuracy
- k means
- cost function
- optimization algorithm
- numerically stable
- hardware implementation
- recognition algorithm
- experimental evaluation
- dynamic programming
- np hard
- search space
- optimal solution
- computational cost
- probabilistic model
- object detection
- worst case
- input data
- matching algorithm
- computational efficiency
- computational complexity
- search algorithm
- parallel implementation
- genetic algorithm