On parametric lower bounds for discrete-time filtering.
Carsten FritscheUmut OrgunerFredrik GustafssonPublished in: ICASSP (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- filtering algorithm
- information filtering
- branch and bound
- lower and upper bounds
- markov chain
- optimal solution
- upper and lower bounds
- parametric models
- finite state
- markov processes
- image registration
- worst case
- dynamic programming
- np hard
- neural network
- vc dimension
- randomly generated problems
- polynomial approximation