PF Scheduling in Hybrid Full Duplex System: Upper Bound and Simple Algorithms.
Jin-Taek LimJimin BaeYonghoon ChoiYoungnam HanPublished in: WCNC (2017)
Keyphrases
- upper bound
- worst case
- learning algorithm
- computationally efficient
- recently developed
- orders of magnitude
- black box
- data structure
- lower bound
- scheduling problem
- computational cost
- times faster
- theoretical analysis
- markov random field
- significant improvement
- upper and lower bounds
- data sets
- parallel processors
- graph theory
- resource allocation
- response time
- image sequences
- information systems
- computer vision
- data mining