An asymptotically 100% efficient parallel implementation of the nonsymmetric QR algorithm.
Duncan G. Hudson IIIRobert A. van de GeijnPublished in: SPDP (1990)
Keyphrases
- parallel implementation
- single pass
- times faster
- computationally efficient
- worst case
- cost function
- dynamic programming
- detection algorithm
- parallel implementations
- computational complexity
- objective function
- parallel computation
- significant improvement
- optimal solution
- distributed memory
- parallel architecture
- distributed systems
- segmentation algorithm
- expectation maximization
- learning algorithm
- probabilistic model
- np hard
- preprocessing
- similarity measure