default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKejing Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Kejing Lu, Chuan Xiao, Yoshiharu Ishikawa:
Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search. ICML 2024- [e3]Makoto Onizuka
, Jae-Gil Lee, Yongxin Tong, Chuan Xiao, Yoshiharu Ishikawa, Sihem Amer-Yahia, H. V. Jagadish, Kejing Lu:
Database Systems for Advanced Applications - 29th International Conference, DASFAA 2024, Gifu, Japan, July 2-5, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14850, Springer 2024, ISBN 978-981-97-5551-6 [contents] - [e2]Makoto Onizuka, Jae-Gil Lee, Yongxin Tong, Chuan Xiao, Yoshiharu Ishikawa, Sihem Amer-Yahia, H. V. Jagadish, Kejing Lu:
Database Systems for Advanced Applications - 29th International Conference, DASFAA 2024, Gifu, Japan, July 2-5, 2024, Proceedings, Part VI. Lecture Notes in Computer Science 14855, Springer 2024, ISBN 978-981-97-5571-4 [contents] - [e1]Makoto Onizuka, Jae-Gil Lee, Yongxin Tong, Chuan Xiao, Yoshiharu Ishikawa, Sihem Amer-Yahia, H. V. Jagadish, Kejing Lu:
Database Systems for Advanced Applications - 29th International Conference, DASFAA 2024, Gifu, Japan, July 2-5, 2024, Proceedings, Part VII. Lecture Notes in Computer Science 14856, Springer 2024, ISBN 978-981-97-5574-5 [contents] - [i1]Kejing Lu, Chuan Xiao, Yoshiharu Ishikawa:
Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search. CoRR abs/2402.11354 (2024) - 2022
- [j5]Kejing Lu, Yoshiharu Ishikawa, Chuan Xiao:
MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances. Proc. VLDB Endow. 16(4): 864-876 (2022) - 2021
- [j4]Kejing Lu, Mineichi Kudo:
AdaLSH: Adaptive LSH for Solving c-Approximate Maximum Inner Product Search Problem. IEICE Trans. Inf. Syst. 104-D(1): 138-145 (2021) - [j3]Kejing Lu, Mineichi Kudo, Chuan Xiao, Yoshiharu Ishikawa:
HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search. Proc. VLDB Endow. 15(2): 246-258 (2021) - [c3]Tianjia Ni, Kento Sugiura, Yoshiharu Ishikawa, Kejing Lu:
Approximate Query Processing with Error Guarantees. BDA (Astronomy, Science, and Engineering) 2021: 268-278 - [c2]Kejing Lu, Mineichi Kudo:
MLSH: Mixed Hash Function Family for Approximate Nearest Neighbor Search in Multiple Fractional Metrics. DASFAA (2) 2021: 569-584 - 2020
- [j2]Kejing Lu, Hongya Wang, Wei Wang, Mineichi Kudo:
VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning. Proc. VLDB Endow. 13(9): 1443-1455 (2020) - [c1]Kejing Lu, Mineichi Kudo:
R2LSH: A Nearest Neighbor Search Scheme Based on Two-dimensional Projected Spaces. ICDE 2020: 1045-1056
2010 – 2019
- 2018
- [j1]Kejing Lu, Hongya Wang, Yingyuan Xiao, Hui Song:
Why locality sensitive hashing works: A practical perspective. Inf. Process. Lett. 136: 49-58 (2018)
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-10-13 17:59 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:
