A delta least squares lattice algorithm for fast sampling.
Parthapratim DeH. Howard FanPublished in: ICASSP (1998)
Keyphrases
- least squares
- monte carlo
- learning algorithm
- theoretical analysis
- probabilistic model
- k means
- experimental evaluation
- sampling algorithm
- sparse linear
- improved algorithm
- computationally efficient
- worst case
- dynamic programming
- objective function
- preprocessing
- computational complexity
- cost function
- computational cost
- levenberg marquardt
- search space
- neural network
- expectation maximization
- matching algorithm
- times faster
- optimal solution
- data sets
- recognition algorithm
- convergence rate
- convex hull
- input data
- lower bound
- evolutionary algorithm
- significant improvement