Biblio

Export 20 results:
Filters: First Letter Of Last Name is C  [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, J., J. Xu Yu, and R. Cheng, "On-Line Preferential Nearest Neighbor Browsing in Large Attributed Graphs", DASFAA Workshops, pp. 2-19, 2010.
Cheng, J., J. Xu Yu, and N. Tang, "Fast Reachability Query Processing", DASFAA, pp. 674-688, 2006.
Cheng, J., and J. Xu Yu, "On-line exact shortest distance query processing", EDBT, pp. 481-492, 2009.
Cheng, J., J. Xu Yu, and P. S. Yu, "Graph Pattern Matching: A Join/Semijoin Approach", IEEE Trans. Knowl. Data Eng., 2010.
Cheng, J., J. Xu Yu, and B. Ding, "Cost-Based Query Optimization for Multi Reachability Joins", DASFAA, pp. 18-30, 2007.
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.
Cheng, H., Y. Zhou, and J. Xu Yu, "Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities", TKDD, vol. 5, no. 2, pp. 12, 2011.
Cheng, J., J. Xu Yu, B. Ding, P. S. Yu, and H. Wang, "Fast Graph Pattern Matching", ICDE, pp. 913-922, 2008.
Cheng, H., J. Ye, and Z. Zhu, "What's Your Next Move: User Activity Prediction in Location-based Social Networks", SDM: SIAM, pp. 171-179, 2013.
Cheng, X., and S. Wang, "Efficient Approximate Algorithms for Empirical Entropy and Mutual Information", SIGMOD, pp. 274-286, 2021.
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.
Cheng, H., J. Han, X. Yan, and P. S. Yu, "Efficient Direct Mining of Selective Discriminative Patterns for Classification", Contrast Data Mining: CRC Press, pp. 39-58, 2013.
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.
Chang, L., J. Xu Yu, and L. Qin, "Fast Maximal Cliques Enumeration in Sparse Graphs", Algorithmica, vol. 66, no. 1, pp. 173-186, 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 Probabilistic Ranking under x-Relation Model", CoRR, vol. abs/0906.4927, 2009.
Chang, L., J. Xu Yu, L. Qin, Y. Zhu, and H. Wang, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
Chang, L., J. Xu Yu, and L. Qin, "Context-sensitive document ranking", CIKM, pp. 1533-1536, 2009.
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.
Chang, L., J. Xu Yu, and L. Qin, "Query ranking in probabilistic XML data", EDBT, pp. 156-167, 2009.