A robust algorithm for approximate compatible observability don't care (CODC) computation.
Nikhil SalujaSunil P. KhatriPublished in: DAC (2004)
Keyphrases
- computational complexity
- learning algorithm
- experimental evaluation
- theoretical analysis
- search space
- computationally efficient
- detection algorithm
- improved algorithm
- kalman filter
- segmentation algorithm
- computational cost
- np hard
- cost function
- k means
- optimal solution
- dynamic programming
- parameter tuning
- highly efficient
- preprocessing
- optimization algorithm
- objective function
- classification algorithm
- recognition algorithm
- piecewise linear
- numerical integration
- times faster
- health care
- expectation maximization
- linear programming
- high accuracy
- worst case
- knn