( en | de | ru )

 

Disambiguation of "Lee, Chung-Nan"

Author of the publication

copydeleteadd this publication to your clipboard
A QoE-based APP layer scheduling scheme for scalable video transmissions over multi-RAT systems?

, , , , and . ICC, page 6779-6784. IEEE, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nan Young Lee

Chung-Ho Lee

Chung-Yung Lee

Chung-Tien Lee

Nan-Hi Cho Lee

 

Other publications of authors with the same name

UAV Path Planning and Collaborative Searching for Air Pollution Source Using the Particle Swarm Optimization., and . ICS, volume 1013 of Communications in Computer and Information Science, page 698-709. Springer, (2018)3D fish animation with visual learning ability., , , and . APSIPA, page 1-4. IEEE, (2014)Dynamic bandwidth recycle algorithm for OVSF-CDMA systems., and . Int. J. Commun. Syst., 19 (3): 263-279 (2006)Receiver Driven Overlap FEC for Scalable Video Coding Extension of the H.264/AVC., , , and . ISCAS, page 637-640. IEEE, (2009)On-demand flow regulated routing for ad hoc wireless networks., , and . Wirel. Commun. Mob. Comput., (2006)SeCoM: An Outsourced Cloud-Based Secure Communication Model for Advanced Privacy Preserving Data Computing and Protection., , , and . IEEE Syst. J., 17 (4): 5130-5141 (December 2023)A Fault Tolerant Elastic Resource Management Framework Towards High Availability of Cloud Services., , , and . CoRR, (2022)A dynamic-edge ACS algorithm for continuous variables problems., , and . Nat. Comput., 16 (2): 339-352 (2017)An Improved Ant Algorithm for Fuzzy Data Mining., , and . ICCCI (2), volume 6422 of Lecture Notes in Computer Science, page 344-351. Springer, (2010)A dynamic CRE and ABS scheme for enhancing network capacity in LTE-advanced heterogeneous networks., , , , and . Wireless Networks, 25 (6): 3307-3322 (2019)