Biblio

Export 169 results:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Q
Qin, L., J. Xu Yu, and B. Ding, "It wigList : Make Twig Pattern Matching Fast", DASFAA, pp. 850-862, 2007.
Qin, L., J. Xu Yu, and L. Chang, "Scalable Keyword Search on Large Data Streams", VLDB J., 2010.
Qin, L., J. Xu Yu, and L. Chang, "Diversifying Top-K Results", PVLDB, vol. 5, no. 11, pp. 1124-1135, 2012.
Qin, L., J. Xu Yu, and L. Chang, "Computing structural statistics by keywords in databases", ICDE, pp. 363-374, 2011.
Qin, L., J. Xu Yu, L. Chang, and Y. Tao, "Querying Communities in Relational Databases", ICDE, pp. 724-735, 2009.
Qiao, M., H. Cheng, and J. Xu Yu, "Querying Shortest Path Distance with Bounded Errors in Large Graphs", SSDBM, pp. 255-273, 2011.
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.
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", IEEE Trans. Knowl. Data Eng., vol. 26, no. 1, pp. 55-68, 2014.
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.
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.
P
Piao, C., W. Zheng, Y. Rong, and H. Cheng, "Maximizing the Reduction Ability for Near-maximum Independent Set Computation", PVLDB, pp. 2466-2478, 2020.
Peng, Y., S. Bian, R. Li, S. Wang, and J. Xu Yu, "Finding Top-r Influential Communities under Aggregation Functions", 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022: IEEE, pp. 1941–1954, 2022.
Peng, Y., J. Xu Yu, and S. Wang, "PSPC: efficient parallel shortest path counting on large-scale graphs", 2023 IEEE 39th International Conference on Data Engineering (ICDE): IEEE, pp. 896–908, 2023.
Pan, Q., H. Cheng, D. Wu, J. Xu Yu, and Y. Ke, "Stock Risk Mining by News", ADC, 2010.
L
Lu, C., J. Xu Yu, and H. Wei, "Exploring Triangle-Free Dense Structures", {IEEE} Trans. Knowl. Data Eng., vol. 30, pp. 278–291, 2018.
Lu, C., J. Xu Yu, R-H. Li, and H. Wei, "Exploring Hierarchies in Online Social Networks", {IEEE} Trans. Knowl. Data Eng., vol. 28, pp. 2086–2100, 2016.
Lu, C., J. Xu Yu, Z. Zhang, and H. Cheng, "Graph Iso/Auto-morphism: A Divide-&-Conquer Approach", SIGMOD, pp. 1195-1207, 2021.
Lu, C., J. Xu Yu, H. Wei, and Y. Zhang, "Finding the maximum clique in massive graphs", {PVLDB}, vol. 10, pp. 1538–1549, 2017.
Lu, C., J. Xu Yu, R-H. Li, and H. Wei, "Exploring Hierarchies in Online Social Networks", CoRR, vol. abs/1502.04220, 2015.
Lu, C., J. Xu Yu, H. Wei, and Y. Zhang, "Enumerating Maximum Cliques in Massive Graphs", IEEE Trans. Knowl. Data Eng., vol. 34, pp. 4215–4230, 2022.
Liu, Z., J. Xu Yu, X. Lin, H. Lu, and W. Wang 0011, "Locating Motifs in Time-Series Data", PAKDD, pp. 343-353, 2005.
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.
Liu, Z., J. Xu Yu, L. Chen 000, 2, and D. Wu, "Detection of Shape Anomalies: A Probabilistic Approach Using Hidden Markov Models", ICDE, pp. 1325-1327, 2008.
Liu, Z., and J. Xu Yu, "On Summarizing Graph Homogeneously", DASFAA Workshops, pp. 299-310, 2011.
Liu, Z., and J. Xu Yu, "Discovering Burst Areas in Fast Evolving Graphs", DASFAA (1), pp. 171-185, 2010.

Pages