Improved bounds for randomized preemptive online matching.
Leah EpsteinAsaf LevinDanny SegevOren WeimannPublished in: Inf. Comput. (2018)
Keyphrases
- lower bound
- matching algorithm
- pattern matching
- matching scheme
- randomized algorithms
- upper bound
- upper and lower bounds
- scheduling problem
- online learning
- real time
- lower and upper bounds
- improved algorithm
- graph matching
- privacy preserving association rule mining
- tight bounds
- online algorithms
- average case
- matching process
- computational complexity
- objective function
- image sequences
- data sets