Algorithms for computing with nilpotent matrix groups over infinite domains.
A. S. DetinkoDane L. FlanneryPublished in: J. Symb. Comput. (2008)
Keyphrases
- computationally expensive
- orders of magnitude
- times faster
- machine learning
- optimization problems
- real world
- benchmark datasets
- computationally efficient
- data sets
- markov random field
- np hard
- feature space
- computational complexity
- computer vision
- application domains
- learning algorithm
- recently developed
- matrix multiplication