An Easily Calculated Bound on Condition for Orthogonal Algorithms.
Katheryn Margaret AdeneyMichael J. KorenbergPublished in: IJCNN (3) (2000)
Keyphrases
- worst case
- learning algorithm
- recently developed
- data structure
- computational cost
- sufficient conditions
- error bounds
- computational efficiency
- computational complexity
- upper bound
- optimization problems
- probabilistic model
- theoretical analysis
- computationally efficient
- database
- significant improvement
- data streams
- image segmentation
- real world