Online identification of frequently executed acyclic paths by leveraging data stream algorithms.
Gaurav KumarSubhajit RoyPublished in: SAC (2013)
Keyphrases
- data streams
- theoretical analysis
- online learning
- data sets
- online algorithms
- computationally efficient
- real time
- special case
- computational cost
- worst case
- optimization problems
- computational complexity
- sliding window
- np hard
- significant improvement
- learning algorithm
- shortest path
- machine learning algorithms
- remote sensing
- outlier detection