Biblio

Export 11 results:
Filters: Author is Xuemin Lin  [Clear All Filters]
2005
Liu, Z., J. Xu Yu, X. Lin, H. Lu, and W. Wang 0011, "Locating Motifs in Time-Series Data", PAKDD, pp. 343-353, 2005.
2006
Cheng, J., J. Xu Yu, X. Lin, H. Wang, and P. S. Yu, "Fast Computation of Reachability Labeling for Large Graphs", EDBT, pp. 961-979, 2006.
2007
Ding, B., J. Xu Yu, S. Wang, L. Qin, X. Zhang, and X. Lin, "Finding Top-k Min-Cost Connected Trees in Databases", ICDE, pp. 836-845, 2007.
2008
Cheng, J., J. Xu Yu, X. Lin, H. Wang, and P. S. Yu, "Fast computing reachability labelings for large graphs with high compression rate", EDBT, pp. 193-204, 2008.
Liu, Z., J. Xu Yu, Y. Ke, X. Lin, and L. Chen 000, 2, "Spotting Significant Changing Subgraphs in Evolving Graphs", ICDM, pp. 917-922, 2008.
2011
Zhu, Y., L. Qin, J. Xu Yu, Y. Ke, and X. Lin, "High efficiency and quality: large graphs matching", CIKM, pp. 1755-1764, 2011.
2013
Chang, L., J. Xu Yu, L. Qin, X. Lin, C. Liu, and W. Liang, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
Zhu, Y., L. Qin, J. Xu Yu, Y. Ke, and X. Lin, "High efficiency and quality: large graphs matching", VLDB J., vol. 22, no. 3, pp. 345-368, 2013.
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", SIGMOD Conference: ACM, pp. 181-192, 2013.
2015
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", {VLDB} J., vol. 24, pp. 245–270, 2015.
2016
Wei, H., J. Xu Yu, C. Lu, and X. Lin, "Speedup Graph Processing by Graph Ordering", Proceedings of the 2016 International Conference on Management of Data, {SIGMOD} Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pp. 1813–1828, 2016.