A Class of Non-optimum-time 3n-Step FSSP Algorithms - A Survey.
Hiroshi UmeoMasashi MaedaAkihiro SousaKiyohisa TaguchiPublished in: PaCT (2015)
Keyphrases
- computational complexity
- computationally expensive
- worst case
- computational cost
- orders of magnitude
- theoretical analysis
- linear programming
- significant improvement
- database
- data mining techniques
- learning algorithm
- computationally efficient
- support vector
- data structure
- pairwise
- database systems
- graphical models
- machine learning
- machine learning algorithms
- benchmark datasets
- data sets
- real time