Improved Bounds for Online Preemptive Matching
Leah EpsteinAsaf LevinDanny SegevOren WeimannPublished in: CoRR (2012)
Keyphrases
- information systems
- lower bound
- matching algorithm
- online learning
- matching process
- upper bound
- scheduling problem
- string matching
- upper and lower bounds
- worst case
- optimal solution
- feature points
- pattern matching
- single machine
- graph matching
- average case
- contingency tables
- real time
- scheduling algorithm
- object recognition
- support vector
- image sequences
- computer vision