Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm.
Mark GiesbrechtErich KaltofenWen-shin LeePublished in: ISSAC (2002)
Keyphrases
- times faster
- computational cost
- computational complexity
- learning algorithm
- algorithms require
- theoretical analysis
- recently developed
- single pass
- matching algorithm
- synthetic and real datasets
- worst case
- related algorithms
- significant improvement
- dynamic programming
- incremental version
- detection algorithm
- computationally efficient
- synthetic and real world datasets
- computational efficiency
- similarity measure
- empirical analyses
- highly efficient
- convergence rate
- filtering algorithm
- image processing algorithms
- iterative algorithms
- synthetic datasets
- noisy data
- incremental algorithms
- algorithm has been developed
- cost function
- k means
- preprocessing
- provably convergent
- genetic algorithm
- space complexity
- expectation maximization
- linear programming
- optimal solution
- nearest neighbour
- benchmark problems
- hybrid algorithm
- memory requirements
- optimization algorithm
- optimization problems
- np hard
- data streams
- neural network
- homology generators