Biblio

Export 10 results:
Filters: First Letter Of Title is I  [Clear All Filters]
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 
C
Cheng, H., D. Lo, Y. Zhou, X. Wang, and X. Yan, "Identifying bug signatures using discriminative graph mining", Proceedings of the eighteenth international symposium on Software testing and analysis, New York, NY, USA, ACM, pp. 141–152, 2009.
G
Guo, Q., S. Wang, Z. Wei, and M. Chen, "Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened.", SIGMOD, pp. 2167-2181, 2020.
H
Huang, W., and J. Xu Yu, "Investigating TSP Heuristics for Location-Based Services", Data Science and Engineering, vol. 2, pp. 71–93, 2017.
J
Jiang, Y., X. Huang, and H. Cheng, "I/O efficient k-truss community search in massive graphs", {VLDB} J., vol. 30, pp. 713-738, 2021.
Q
Qin, L., J. Xu Yu, and B. Ding, "It wigList : Make Twig Pattern Matching Fast", DASFAA, pp. 850-862, 2007.
W
Wu, D., G. Pui Cheong Fung, J. Xu Yu, and Z. Liu, "Integrating Multiple Data Sources for Stock Prediction", WISE, pp. 77-89, 2008.
Z
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.
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.
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.
Zheng, W., H. Cheng, J. Yu Xu, L. Zou, and K. Zhao, "Interactive natural language question answering over knowledge graphs", Inf. Sci., vol. 481, pp. 141-159, 2019.