default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYingfan Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Jinxin Yang, Hui Li, Wenlong Song, Yiming Si, Hui Zhang, Kankan Zhao, Kewei Wei, Yingfan Liu, Jiangtao Cui:
One Size Cannot Fit All: A Self-adaptive Dispatcher for Skewed Hash Join in Shared-Nothing RDBMSs. DASFAA (1) 2024: 249-265- [i4]Yingfan Liu, Renyu Zhu, Ming Gao:
Personalized Programming Guidance based on Deep Programming Learning Style Capturing. CoRR abs/2403.14638 (2024) - [i3]Shuo Yang, Jiadong Xie, Yingfan Liu, Jeffrey Xu Yu, Xiyue Gao, Qianru Wang, Yanguo Peng, Jiangtao Cui:
Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search. CoRR abs/2410.01231 (2024) - 2023
- [j7]Yingfan Liu
, Chaowei Song, Hong Cheng, Xiaofang Xia, Jiangtao Cui:
Accelerating massive queries of approximate nearest neighbor search on high-dimensional data. Knowl. Inf. Syst. 65(10): 4185-4212 (2023) - [c3]Yingfan Liu, Renyu Zhu, Ming Gao:
Personalized Programming Guidance Based on Deep Programming Learning Style Capturing. ICCSE (1) 2023: 214-231 - [i2]Jinxin Yang, Hui Li, Yiming Si, Hui Zhang, Kankan Zhao, Kewei Wei, Wenlong Song, Yingfan Liu, Jiangtao Cui:
One Size Cannot Fit All: a Self-Adaptive Dispatcher for Skewed Hash Join in Shared-nothing RDBMSs. CoRR abs/2303.07787 (2023) - 2022
- [j6]Xiaofang Xia, Yang Liu, Bo Yang, Yingfan Liu, Jiangtao Cui, Yinlong Zhang:
An Expectation Maximization Based Adaptive Group Testing Method for Improving Efficiency and Sensitivity of Large-Scale Screening of COVID-19. IEEE J. Biomed. Health Informatics 26(2): 482-493 (2022) - 2021
- [i1]Yingfan Liu, Hong Cheng, Jiangtao Cui:
Revisiting k-Nearest Neighbor Graph Construction on High-Dimensional Data : Experiments and Analyses. CoRR abs/2112.02234 (2021)
2010 – 2019
- 2019
- [j5]Xiaokang Feng, Jiangtao Cui, Hui Li, Yingfan Liu:
An efficient LSH indexing on discriminative short codes for high-dimensional nearest neighbors. Multim. Tools Appl. 78(17): 24407-24429 (2019) - 2018
- [j4]Yanguo Peng, Hui Li, Jiangtao Cui, Jianfeng Ma, Yingfan Liu:
Towards Secure Approximate ${k}$ -Nearest Neighbor Query Over Encrypted High-Dimensional Data. IEEE Access 6: 23137-23151 (2018) - [j3]Yingfan Liu, Hao Wei, Hong Cheng:
Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data. Inf. Sci. 465: 484-504 (2018) - 2017
- [j2]Xiaokang Feng, Jiangtao Cui, Yingfan Liu, Hui Li:
Effective optimizations of cluster-based nearest neighbor search in high-dimensional space. Multim. Syst. 23(1): 139-153 (2017) - [c2]Yingfan Liu, Hong Cheng, Jiangtao Cui:
PQBF: I/O-Efficient Approximate Nearest Neighbor Search by Product Quantization. CIKM 2017: 667-676 - 2014
- [j1]Yingfan Liu, Jiangtao Cui, Zi Huang, Hui Li, Heng Tao Shen:
SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search. Proc. VLDB Endow. 7(9): 745-756 (2014) - 2013
- [c1]Jiangtao Cui, Zi Huang, Bo Wang, Yingfan Liu:
Near-Optimal Partial Linear Scan for Nearest Neighbor Search in High-Dimensional Space. DASFAA (1) 2013: 101-115
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-08 21:27 CET 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:
