Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS.
Gilles GeeraertsJean-François RaskinLaurent Van BeginPublished in: J. Comput. Syst. Sci. (2006)
Keyphrases
- orders of magnitude
- optimization problems
- search engine
- graph theory
- times faster
- computational complexity
- computationally efficient
- theoretical analysis
- computer vision algorithms
- machine learning
- memory requirements
- classification algorithm
- benchmark datasets
- probabilistic model
- computational cost
- data structure
- multiscale
- case study
- learning algorithm