Exact and approximate polynomial decomposition methods for signal processing applications.
Sefa DemirtasGuolong SuAlan V. OppenheimPublished in: ICASSP (2013)
Keyphrases
- decomposition methods
- exact and approximate
- signal processing
- decomposition method
- constraint satisfaction problems
- training support vector machines
- string matching
- image processing
- pattern recognition
- database theory
- lower bound
- query evaluation
- branch and bound
- dynamic programming
- support vector machine
- computer vision
- computational intelligence
- special case
- decomposition algorithm
- working set
- hypertree decomposition