A rearrangement algorithm for switching networks composed of digital symmetrical matrices.
Dung T. HuynhHai N. NguyenPublished in: Inf. Sci. (2000)
Keyphrases
- experimental evaluation
- cost function
- times faster
- computational complexity
- learning algorithm
- np hard
- detection algorithm
- segmentation algorithm
- optimization algorithm
- preprocessing
- objective function
- search space
- recognition algorithm
- dynamic programming
- least squares
- worst case
- data sets
- fully connected
- linear systems
- computationally efficient
- high accuracy
- significant improvement
- feature space
- optimal solution
- similarity measure
- social networks
- neural network