A nearly optimal algorithm to decompose binary forms.
Matías R. BenderJean-Charles FaugèreLudovic PerretElias P. TsigaridasPublished in: CoRR (2018)
Keyphrases
- dynamic programming
- optimal solution
- detection algorithm
- preprocessing
- worst case
- theoretical analysis
- k means
- experimental evaluation
- computational cost
- matching algorithm
- learning algorithm
- computational complexity
- improved algorithm
- times faster
- cost function
- optimization algorithm
- high accuracy
- search space
- convergence rate
- recognition algorithm
- probabilistic model
- piecewise linear
- segmentation algorithm
- classification algorithm
- globally optimal
- optimal parameters
- locally optimal