default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuguang Ren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Xiangnan Ren
, Neha Sengupta, Xuguang Ren, Junhu Wang, Olivier Curé:
Finding Minimum Connected Subgraphs With Ontology Exploration on Large RDF Data. IEEE Trans. Knowl. Data Eng. 35(11): 11403-11418 (2023)- [i3]Zhengzhong Liu, Aurick Qiao, Willie Neiswanger, Hongyi Wang, Bowen Tan, Tianhua Tao, Junbo Li, Yuqi Wang, Suqi Sun, Omkar Pangarkar, Richard Fan, Yi Gu, Victor Miller, Yonghao Zhuang, Guowei He, Haonan Li, Fajri Koto, Liping Tang, Nikhil Ranjan, Zhiqiang Shen, Xuguang Ren, Roberto Iriondo, Cun Mu, Zhiting Hu, Mark Schulze, Preslav Nakov, Tim Baldwin, Eric P. Xing:
LLM360: Towards Fully Transparent Open-Source LLMs. CoRR abs/2312.06550 (2023) - 2020
- [i2]Xiangnan Ren, Neha Sengupta, Xuguang Ren, Junhu Wang, Olivier Curé:
Finding Minimum Connected Subgraphs with Ontology Exploration on Large RDF Data. CoRR abs/2010.06336 (2020)
2010 – 2019
- 2019
- [j6]Junhu Wang, Xuguang Ren, Shikha Anirban, Xin-Wen Wu:
Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs. Inf. Sci. 482: 363-373 (2019) - [j5]Nigel Franciscus, Xuguang Ren, Bela Stantic:
Dependency graph for short text extraction and summarization. J. Inf. Telecommun. 3(4): 413-429 (2019) - [j4]Xuguang Ren, Junhu Wang, Wook-Shin Han, Jeffrey Xu Yu:
Fast and Robust Distributed Subgraph Enumeration. Proc. VLDB Endow. 12(11): 1344-1356 (2019) - [c6]Nigel Franciscus, Xuguang Ren, Junhu Wang, Bela Stantic:
Word Mover's Distance for Agglomerative Short Text Clustering. ACIIDS (1) 2019: 128-139 - [c5]Lei Lei, Xuguang Ren, Nigel Franciscus, Junhu Wang, Bela Stantic:
Event Prediction Based on Causality Reasoning. ACIIDS (1) 2019: 165-176 - [i1]Xuguang Ren, Junhu Wang, Wook-Shin Han, Jeffrey Xu Yu:
Fast and Robust Distributed Subgraph Enumeration. CoRR abs/1901.07747 (2019) - 2018
- [j3]Nigel Franciscus, Xuguang Ren, Bela Stantic:
Precomputing architecture for flexible and efficient big data analytics. Vietnam. J. Comput. Sci. 5(2): 133-142 (2018) - [c4]Xuguang Ren, Junhu Wang, Nigel Franciscus, Bela Stantic:
Experimental Clarification of Some Issues in Subgraph Isomorphism Algorithms. ACIIDS (2) 2018: 71-80 - [c3]Nigel Franciscus, Xuguang Ren, Bela Stantic:
Beyond Word-Cloud: A Graph Model Derived from Beliefs. ACIIDS (2) 2018: 81-90 - 2017
- [c2]Nigel Franciscus, Xuguang Ren, Bela Stantic:
Answering Temporal Analytic Queries over Big Data Based on Precomputing Architecture. ACIIDS (1) 2017: 281-290 - 2016
- [j2]Xuguang Ren, Junhu Wang:
Multi-Query Optimization for Subgraph Isomorphism Search. Proc. VLDB Endow. 10(3): 121-132 (2016) - 2015
- [j1]Xuguang Ren, Junhu Wang:
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs. Proc. VLDB Endow. 8(5): 617-628 (2015) - 2012
- [c1]Xuguang Ren, Xin-Wen Wu:
A novel dynamic user authentication scheme. ISCIT 2012: 713-717
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-07-23 21:56 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:
