default search action
Ling Ding 0004
Person information
- affiliation: Facebook, Seattle, WA, USA
- affiliation: University of Washington Tacoma, Institute of Technology, Tacoma, WA, USA
- affiliation (PhD): University of Texas at Dallas, Department of Computer Science, Richardson, TX, USA
- affiliation: Shanghai Jiao Tong University, Computer Science Department, Shanghai, China
Other persons with the same name
- Ling Ding — disambiguation page
- Ling Ding 0001 — Tianjin University, College of Intelligence and Computing, Tianjin, China
- Ling Ding 0002 — University of California, Los Angeles, CA, USA (and 2 more)
- Ling Ding 0003 — Tongji University, College of Electronic and Information Engineering, Shanghai, China
- Ling Ding 0005 — Zhejiang Sci-Tech University, Department of Management Science and Engineering, Hangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j8]Wei Wang, Rongyuan Liu, Fuping Gan, Ping Zhou, Xiangwen Zhang, Ling Ding:
Monitoring and Evaluating Restoration Vegetation Status in Mine Region Using Remote Sensing Data: Case Study in Inner Mongolia, China. Remote. Sens. 13(7): 1350 (2021) - [c12]Wei Wang, Rongyuan Liu, Huiyun Yang, Ping Zhou, Xiangwen Zhang, Ling Ding:
Urban Forest Identification from High-Resolution Images Using Deep-Learning Method. IGARSS 2021: 5283-5286 - 2020
- [c11]Xiangwen Zhang, Rongyuan Liu, Fuping Gan, Wei Wang, Ling Ding, Bokun Yan:
Evaluation of Spatial-Temporal Variation of Vegetation Restoration in Dexing Copper Mine Area Using Remote Sensing Data. IGARSS 2020: 2013-2016
2010 – 2019
- 2016
- [r1]Weili Wu, Ling Ding:
Maximum Lifetime Coverage. Encyclopedia of Algorithms 2016: 1235-1238 - 2015
- [j7]Yuqing Zhu, Weili Wu, Deying Li, Ling Ding:
A Double-Auction-Based Mechanism to Stimulate Secondary Users for Cooperative Sensing in Cognitive Radio Networks. IEEE Trans. Veh. Technol. 64(8): 3770-3782 (2015) - [c10]Sambasivam Ramasubramanian, Sam Chung, Seungwan Ryu, Ling Ding:
Secure and Smart Media Sharing Based on a Novel Mobile Device-to-Device Communication Framework with Security and Procedures. RIIT 2015: 35-40 - 2014
- [j6]Kai Xing, Weili Wu, Ling Ding, Lidong Wu, James Willson:
An efficient routing protocol based on consecutive forwarding prediction in delay tolerant networks. Int. J. Sens. Networks 15(2): 73-82 (2014) - [c9]Jun Li, Xiaofeng Gao, Guihai Chen, Fengwei Gao, Ling Ding:
Performance Analysis and Improvement for the Construction of MCDS Problem in 3D Space. COCOA 2014: 184-199 - [c8]Yuqing Zhu, Yiwei Jiang, Weili Wu, Ling Ding, Ankur Teredesai, Deying Li, Wonjun Lee:
Minimizing makespan and total completion time in MapReduce-like systems. INFOCOM 2014: 2166-2174 - [c7]Yuqing Zhu, Weili Wu, James Willson, Ling Ding, Lidong Wu, Deying Li, Wonjun Lee:
An approximation algorithm for client assignment in client/server systems. INFOCOM 2014: 2777-2785 - [c6]Yitao Li, Ling Ding, Jie Sheng, Cong Liu, Ankur Teredesai:
An Effective Message Forwarding Algorithm for Delay Tolerant Network with Cyclic Probabilistic Influences. MSN 2014: 179-185 - 2012
- [j5]Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee:
Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas. IEEE Trans. Mob. Comput. 11(7): 1102-1112 (2012) - [c5]Ling Ding, Weili Wu, James Willson, Lidong Wu, Zaixin Lu, Wonjun Lee:
Constant-approximation for target coverage problem in wireless sensor networks. INFOCOM 2012: 1584-1592 - 2011
- [j4]Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu Zhu, Ding-Zhu Du:
An exact algorithm for minimum CDS with shortest path constraint in wireless networks. Optim. Lett. 5(2): 297-306 (2011) - [j3]Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee, Ding-Zhu Du:
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks. IEEE Trans. Parallel Distributed Syst. 22(10): 1601-1609 (2011) - [c4]Ling Ding, Weili Wu, James Willson, Hongjie Du, Wonjun Lee:
Construction of directional virtual backbones with minimum routing cost in wireless networks. INFOCOM 2011: 1557-1565 - 2010
- [j2]Donghyun Kim, Wei Wang, Ling Ding, Jihwan Lim, Heekuck Oh, Weili Wu:
Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks. Optim. Lett. 4(3): 383-392 (2010) - [j1]Minglu Li, Ling Ding, Yifeng Shao, Zhensheng Zhang, Bo Li:
On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas. IEEE Trans. Veh. Technol. 59(3): 1433-1442 (2010) - [c3]Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu Zhu, Ding-Zhu Du:
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks. ICDCS 2010: 448-457
2000 – 2009
- 2008
- [c2]Ling Ding, Yifeng Shao, Minglu Li:
On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas. WCNC 2008: 2295-2300 - 2007
- [c1]Ning Xiao, Ling Ding, Minglu Li, Min-You Wu:
Geographic Probabilistic Routing Protocol for Wireless Mesh Network. APPT 2007: 477-486
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint