Biblio

Export 77 results:
Filters: Author is Jeffrey Xu Yu  [Clear All Filters]
2014
Wei, H., J. Xu Yu, C. Lu, and R. Jin, "Reachability Querying: An Independent Permutation Labeling Approach", PVLDB, vol. 7, no. 12, pp. 1191–1202, 2014.
2013
Shang, Z., and J. Xu Yu, "Catch the Wind: Graph workload balancing on cloud", ICDE: IEEE Computer Society, pp. 553-564, 2013.
Qiao, M., H. Cheng, L. Qin, J. Xu Yu, P. S. Yu, and L. Chang, "Computing weight constraint reachability in large networks", VLDB J., vol. 22, no. 3, pp. 275-294, 2013.
Li, R-H., J. Liu, J. Xu Yu, H. Chen, and H. Kitagawa, "Co-occurrence prediction in a large location-based social network", Frontiers of Computer Science, vol. 7, no. 2, pp. 185-194, 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.
Chang, L., J. Xu Yu, and L. Qin, "Fast Maximal Cliques Enumeration in Sparse Graphs", Algorithmica, vol. 66, no. 1, pp. 173-186, 2013.
Liu, Z., R. Jin, H. Cheng, and J. Xu Yu, "Frequent Subgraph Summarization with Error Control", WAIM: Springer, pp. 1-12, 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.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Random-walk domination in large graphs: problem definitions and fast solutions", CoRR, vol. abs/1302.4546, 2013.
Li, R-H., and J. Xu Yu, "Scalable Diversified Ranking on Large Graphs", IEEE Trans. Knowl. Data Eng., vol. 25, no. 9, pp. 2133-2146, 2013.
Qiao, M., L. Qin, H. Cheng, J. Xu Yu, and W. Tian, "Top-K Nearest Keyword Search on Large Graphs", PVLDB, vol. 6, no. 10, pp. 901-912, 2013.
Huang, X., H. Cheng, R-H. Li, L. Qin, and J. Xu Yu, "Top-K Structural Diversity Search in Large Networks", PVLDB, vol. 6, no. 13, pp. 1618-1629, 2013.
2012
Qin, L., J. Xu Yu, and L. Chang, "Computing Structural Statistics by Keywords in Databases", IEEE Trans. Knowl. Data Eng., vol. 24, no. 10, pp. 1731-1746, 2012.
Qin, L., J. Xu Yu, and L. Chang, "Diversifying Top-K Results", PVLDB, vol. 5, no. 11, pp. 1124-1135, 2012.
Zhu, Y., L. Qin, J. Xu Yu, and H. Cheng, "Finding top-k similar graphs in graph databases", EDBT, pp. 456-467, 2012.
Zhu, Y., J. Xu Yu, H. Cheng, and L. Qin, "Graph classification: a diversified discriminative feature selection approach", CIKM, pp. 205-214, 2012.
Zhang, Z., J. Xu Yu, L. Qin, Q. Zhu, and X. Zhou, "I/O cost minimization: reachability queries processing over massive graphs", EDBT, pp. 468-479, 2012.
Li, R-H., J. Xu Yu, X. Huang, H. Cheng, and Z. Shang, "Measuring robustness of complex networks under MVC attack", CIKM, pp. 1512-1516, 2012.
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", ICDE, pp. 462-473, 2012.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Robust Reputation-Based Ranking on Bipartite Rating Networks", SDM, pp. 612-623, 2012.
Huang, X., H. Cheng, J. Yang, J. Xu Yu, H. Fei, and J. Huan, "Semi-supervised Clustering of Graph Objects: A Subgraph Mining Approach", DASFAA (1), pp. 197-212, 2012.
Chang, L., J. Xu Yu, L. Qin, H. Cheng, and M. Qiao, "The exact distance to destination in undirected world", VLDB J., vol. 21, no. 6, pp. 869-888, 2012.
2011
Chang, L., J. Xu Yu, L. Qin, Y. Zhu, and H. Wang, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 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.

Pages