Faster Algorithms for Half-Integral T-Path Packing.
Maxim A. BabenkoStepan ArtamonovPublished in: ISAAC (2017)
Keyphrases
- learning algorithm
- recently developed
- computationally efficient
- worst case
- computational complexity
- significant improvement
- data structure
- theoretical analysis
- computationally demanding
- data streams
- markov random field
- database
- classification algorithm
- computational efficiency
- computationally expensive
- times faster
- feature selection
- graph theory
- orders of magnitude faster