Inexpensive Linear-Optical Implementations of Deutsch's Algorithm.
Michael StayPublished in: Bull. EATCS (2004)
Keyphrases
- detection algorithm
- experimental evaluation
- preprocessing
- learning algorithm
- times faster
- computational complexity
- linear complexity
- dynamic programming
- optimization algorithm
- convergence rate
- clustering method
- computational cost
- convex quadratic programming
- matching algorithm
- segmentation algorithm
- worst case
- significant improvement
- linear programming
- probabilistic model
- tree structure
- k means
- closed form
- optimal solution
- memory requirements
- objective function
- similarity measure
- data sets