default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPei Yao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Pei Yao, Longkun Guo
, Peng Li, Jiawei Lin:
Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane. Comput. Networks 228: 109717 (2023)- [j4]Longkun Guo, Kewen Liao, Di Xiao, Pei Yao:
Submodular maximization over data streams with differential privacy noise. Theor. Comput. Sci. 944: 113625 (2023) - [j3]Lixia Liu, Axin Jin, Anzhong Jin, Shiyu Xue, Pei Yao, Gang Dong, Haoqiang Shi, Xu Jin, Shubo Liu, Ailing Lv, Pengfei Zhang, Jian Shang, Wenxin Chen:
FY-3E Wind Scatterometer Prelaunch and Commissioning Performance Verification. IEEE Trans. Geosci. Remote. Sens. 61: 1-12 (2023) - 2022
- [j2]Pei Yao, Longkun Guo:
Exact algorithms for finding constrained minimum spanning trees. J. Comb. Optim. 44(3): 2085-2103 (2022) - 2016
- [j1]Jin Tao, Qiankun Zhang, Yunfeng Xiao, Xiaoying Li, Pei Yao, Wei Pang, Hao Zhang, Xuexin Duan, Daihua Zhang, Jing Liu:
A Microfluidic-Based Fabry-Pérot Gas Sensor. Micromachines 7(3): 36 (2016)
Conference and Workshop Papers
- 2021
- [c7]Pei Yao, Longkun Guo, Shuangjuan Li, Huihong Peng:
Target Coverage with Minimum Number of Camera Sensors. COCOA 2021: 12-24 - [c6]Di Xiao, Longkun Guo, Kewen Liao, Pei Yao:
Streaming Submodular Maximization Under Differential Privacy Noise. COCOA 2021: 431-444 - [c5]Pei Yao, Longkun Guo, Jiguo Yu:
Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrier Coverage with Mobile Sensors on the Plane. ICDCS 2021: 1132-1133 - [c4]Pei Yao, Liang Feng:
Integrating Policy Reuse with Learning from Demonstrations for Knowledge Transfer in Deep Reinforcement Learning. ICONIP (5) 2021: 659-667 - [c3]Pei Yao, Longkun Guo, Peng Li, Jiawei Lin:
Improved Fast Algorithms for Optimal Min-Max Line Barrier Coverage with Mobile Sensors on the Plane. MSWiM 2021: 159-166 - 2019
- [c2]Zhendong Hao, Longkun Guo, Pei Yao, Peihuang Huang, Huihong Peng:
Efficient Algorithms for Constrained Clustering with Side Information. PAAP 2019: 275-286 - 2017
- [c1]Pei Yao, Longkun Guo:
Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees. COCOA (1) 2017: 103-110
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-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
