Остановите войну!
for scientists:
default search action
Yun Peng
Publications
- 2023
- [j67]Yun Peng, Byron Choi, Tsz Nam Chan, Jianye Yang, Jianliang Xu:
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases. Proc. ACM Manag. Data 1(1): 54:1-54:27 (2023) - [j66]Lyu Xu, Byron Choi, Yun Peng, Jianliang Xu, Sourav S. Bhowmick:
A Framework for Privacy Preserving Localized Graph Pattern Query Processing. Proc. ACM Manag. Data 1(2): 129:1-129:27 (2023) - 2022
- [j56]Tsz Nam Chan, Leong Hou U, Yun Peng, Byron Choi, Jianliang Xu:
Fast Network K-function-based Spatial Analysis. Proc. VLDB Endow. 15(11): 2853-2866 (2022) - [c83]Yun Peng, Byron Choi, Tsz Nam Chan, Jianliang Xu:
LAN: Learning-based Approximate k-Nearest Neighbor Search in Graph Databases. ICDE 2022: 2508-2521 - 2021
- [j51]Yun Peng, Byron Choi, Jianliang Xu:
Graph Learning for Combinatorial Optimization: A Survey of State-of-the-Art. Data Sci. Eng. 6(2): 119-141 (2021) - [j50]Yun Peng, Xin Lin, Byron Choi, Bingsheng He:
VColor*: a practical approach for coloring large graphs. Frontiers Comput. Sci. 15(4): 154610 (2021) - [c78]Yun Peng, Byron Choi, Jianliang Xu:
Graph Edit Distance Learning via Modeling Optimum Matchings with Constraints. IJCAI 2021: 1534-1540 - 2020
- [i2]Yun Peng, Byron Choi, Jianliang Xu:
Graph Embedding for Combinatorial Optimization: A Survey. CoRR abs/2008.12646 (2020) - 2018
- [c74]Xin Lin, Yun Peng, Jianliang Xu, Byron Choi:
Human-Powered Data Cleaning for Probabilistic Reachability Queries on Uncertain Graphs. ICDE 2018: 1755-1756 - 2017
- [j34]Xin Lin, Yun Peng, Byron Choi, Jianliang Xu:
Human-Powered Data Cleaning for Probabilistic Reachability Queries on Uncertain Graphs. IEEE Trans. Knowl. Data Eng. 29(7): 1452-1465 (2017) - 2016
- [c62]Yun Peng, Byron Choi, Bingsheng He, Shuigeng Zhou, Ruzhi Xu, Xiaohui Yu:
VColor: A practical vertex-cut based approach for coloring large graphs. ICDE 2016: 97-108 - 2015
- [j30]Yun Peng, Zhe Fan, Byron Choi, Jianliang Xu, Sourav S. Bhowmick:
Authenticated Subgraph Similarity Searchin Outsourced Graph Databases. IEEE Trans. Knowl. Data Eng. 27(7): 1838-1860 (2015) - 2014
- [j29]Rui Chen, Yun Peng, Byron Choi, Jianliang Xu, Haibo Hu:
A private DNA motif finding algorithm. J. Biomed. Informatics 50: 122-132 (2014) - [j28]Yun Peng, Byron Choi, Jianliang Xu, Haibo Hu, Sourav S. Bhowmick:
Side-Effect Estimation: A Filtering Approach to the View Update Problem. IEEE Trans. Knowl. Data Eng. 26(9): 2307-2322 (2014) - [j27]Zhe Fan, Yun Peng, Byron Choi, Jianliang Xu, Sourav S. Bhowmick:
Towards Efficient Authenticated Subgraph Query Service in Outsourced Graph Databases. IEEE Trans. Serv. Comput. 7(4): 696-713 (2014) - 2013
- [c50]Liyan Song, Yun Peng, Byron Choi, Jianliang Xu, Bingsheng He:
Spectral Decomposition for Optimal Graph Index Prediction. PAKDD (1) 2013: 187-200 - 2011
- [c47]Jintian Deng, Fei Liu, Yun Peng, Byron Choi, Jianliang Xu:
Predicting the optimal ad-hoc index for reachability queries on graph databases. CIKM 2011: 2357-2360 - [c46]Yun Peng, Byron Choi, Jianliang Xu:
Selectivity estimation of twig queries on cyclic graphs. ICDE 2011: 960-971
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-09 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint