On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping.
Hans F. de GrootePublished in: Theor. Comput. Sci. (1978)
Keyphrases
- significant improvement
- computationally efficient
- computational complexity
- exhaustive search
- worst case
- efficient algorithms for computing
- data sets
- orders of magnitude
- theoretical analysis
- dynamic programming
- data structure
- piecewise linear
- lower bound
- search algorithm
- optimal solution
- data integration
- learning algorithm
- times faster
- convergence rate
- genetic algorithm
- efficient computation
- data mining