default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiao Qiao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Chaoji Zuo
, Miao Qiao, Wenchao Zhou, Feifei Li, Dong Deng:
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search. Proc. ACM Manag. Data 2(1): 69:1-69:26 (2024)- [j13]Yizhou Dai, Miao Qiao, Rong-Hua Li:
On Density-based Local Community Search. Proc. ACM Manag. Data 2(2): 88 (2024) - [j12]Jiaxing Xu, Qingtian Bian, Xinhang Li, Aihu Zhang, Yiping Ke, Miao Qiao, Wei Zhang, Wei Khang Jeremy Sim, Balázs Gulyás:
Contrastive Graph Pooling for Explainable Classification of Brain Networks. IEEE Trans. Medical Imaging 43(9): 3292-3305 (2024) - [i6]Xiaowei Ye, Miao Qiao, Ronghua Li, Qi Zhang, Guoren Wang:
Scalable k-clique Densest Subgraph Search. CoRR abs/2403.05775 (2024) - [i5]Jiaxing Xu, Kai He, Mengcheng Lan, Qingtian Bian, Wei Li, Tieying Li, Yiping Ke, Miao Qiao:
Contrasformer: A Brain Network Contrastive Transformer for Neurodegenerative Condition Identification. CoRR abs/2409.10944 (2024) - 2023
- [j11]Zijin Feng, Miao Qiao, Hong Cheng:
Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation. Proc. ACM Manag. Data 1(3): 215:1-215:25 (2023) - [c17]Yiping Liu, Jiamou Liu, Bakh Khoussainov, Miao Qiao, Bo Yan, Mengxiao Zhang:
Centralization Problem for Opinion Convergence in Decentralized Networks. ASONAM 2023: 658-665 - [c16]Jiaxing Xu, Yunhan Yang, David Tse Jung Huang, Sophi Shilpa Gururajapathy, Yiping Ke, Miao Qiao, Alan Wang, Haribalan Kumar, Josh McGeown, Eryn Kwon:
Data-Driven Network Neuroscience: On Data Collection and Benchmark. NeurIPS 2023 - [i4]Jiaxing Xu, Qingtian Bian, Xinhang Li, Aihu Zhang, Yiping Ke, Miao Qiao, Wei Zhang, Wei Khang Jeremy Sim, Balázs Gulyás:
Contrastive Graph Pooling for Explainable Classification of Brain Networks. CoRR abs/2307.11133 (2023) - 2022
- [j10]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Distance labeling: on parallelism, compression, and ordering. VLDB J. 31(1): 129-155 (2022) - [c15]Zijin Feng, Miao Qiao, Hong Cheng:
Clustering Activation Networks. ICDE 2022: 780-792 - [c14]Wentao Li, Miao Qiao, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin:
On Scalable Computation of Graph Eccentricities. SIGMOD Conference 2022: 904-916 - [c13]Yizhou Dai, Miao Qiao, Lijun Chang:
Anchored Densest Subgraph. SIGMOD Conference 2022: 1200-1213 - [i3]Yiping Liu, Jiamou Liu, Bakhadyr Khoussainov, Miao Qiao, Bo Yan:
Centralization Problem for Opinion Convergence in Decentralized Networks. CoRR abs/2210.16041 (2022) - [i2]David Tse Jung Huang, Sophi Shilpa Gururajapathy, Yiping Ke, Miao Qiao, Alan Wang, Haribalan Kumar, Yunhan Yang:
Data-Driven Network Neuroscience: On Data Collection and Benchmark. CoRR abs/2211.12421 (2022) - 2021
- [c12]Hao Zhang, Miao Qiao, Jeffrey Xu Yu, Hong Cheng:
Fast Distributed Complex Join Processing. ICDE 2021: 2087-2092 - [c11]Miao Qiao, Yufei Tao:
Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins. PODS 2021: 166-180 - [e1]Miao Qiao, Gottfried Vossen, Sen Wang, Lei Li:
Databases Theory and Applications - 32nd Australasian Database Conference, ADC 2021, Dunedin, New Zealand, January 29 - February 5, 2021, Proceedings. Lecture Notes in Computer Science 12610, Springer 2021, ISBN 978-3-030-69376-3 [contents] - [i1]Hao Zhang, Miao Qiao, Jeffrey Xu Yu, Hong Cheng:
Fast Distributed Complex Join Processing. CoRR abs/2102.13370 (2021) - 2020
- [c10]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. SIGMOD Conference 2020: 1367-1381 - [c9]Lijun Chang, Miao Qiao:
Deconstruct Densest Subgraphs. WWW 2020: 2747-2753
2010 – 2019
- 2019
- [j9]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Eccentricities on small-world networks. VLDB J. 28(5): 765-792 (2019) - [c8]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Scaling Distance Labeling on Small-World Networks. SIGMOD Conference 2019: 1060-1077 - 2018
- [c7]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Exacting Eccentricity for Small-World Networks. ICDE 2018: 785-796 - 2017
- [j8]Miao Qiao, Hao Zhang, Hong Cheng:
Subgraph Matching: on Compression and Computation. Proc. VLDB Endow. 11(2): 176-188 (2017) - [j7]Yufei Tao, Xiaocheng Hu, Miao Qiao:
Stream sampling over windows with worst-case optimality and $$\ell $$ ℓ -overlap independence. VLDB J. 26(4): 493-510 (2017) - 2016
- [j6]Xiaocheng Hu, Miao Qiao, Yufei Tao:
I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration. J. Comput. Syst. Sci. 82(8): 1300-1315 (2016) - [c6]Miao Qiao, Junhao Gan, Yufei Tao:
Range Thresholding on Streams. SIGMOD Conference 2016: 571-582 - 2015
- [j5]Xiaocheng Hu, Miao Qiao, Yufei Tao:
Independent Range Sampling on a RAM. IEEE Data Eng. Bull. 38(3): 76-83 (2015) - [c5]Xiaocheng Hu, Miao Qiao, Yufei Tao:
External Memory Stream Sampling. PODS 2015: 229-239 - [c4]Xiaocheng Hu, Miao Qiao, Yufei Tao:
Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration. PODS 2015: 291-301 - 2014
- [j4]Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu:
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. IEEE Trans. Knowl. Data Eng. 26(1): 55-68 (2014) - [c3]Xiaocheng Hu, Miao Qiao, Yufei Tao:
Independent range sampling. PODS 2014: 246-255 - 2013
- [b1]Miao Qiao:
Query processing in large-scale networks. Chinese University of Hong Kong, Hong Kong, 2013 - [j3]Miao Qiao, Lu Qin, Hong Cheng, Jeffrey Xu Yu, Wentao Tian:
Top-K Nearest Keyword Search on Large Graphs. Proc. VLDB Endow. 6(10): 901-912 (2013) - [j2]Miao Qiao, Hong Cheng, Lu Qin, Jeffrey Xu Yu, Philip S. Yu, Lijun Chang:
Computing weight constraint reachability in large networks. VLDB J. 22(3): 275-294 (2013) - 2012
- [j1]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Hong Cheng, Miao Qiao:
The exact distance to destination in undirected world. VLDB J. 21(6): 869-888 (2012) - [c2]Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu:
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme. ICDE 2012: 462-473 - 2011
- [c1]Miao Qiao, Hong Cheng, Jeffrey Xu Yu:
Querying Shortest Path Distance with Bounded Errors in Large Graphs. SSDBM 2011: 255-273
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-15 21:34 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:
