Showing results 13 to 32 of 113
< previous
next >
| Issue Date | Title | Author(s) |
| 2017-05-09 | DAG reduction: Fast Answering reachability queries | Zhou, J; Zhou, S; Yu, JX; Wei, H; Chen, Z; Tang, X |
| 2019-01-15 | Direction-based multiple views on data | Guo, X; Yu, JX; Li, RH; Miao, X |
| 2017-06-01 | Discovering conditional matching rules | Wang, Y; Song, S; Chen, L; Yu, JX; Cheng, H |
| 2018-09 | Discovering large conserved functional components in global network alignment by graph matching | Zhu, Y; Li, Y; Liu, J; Qin, L; Yu, JX |
| 2012-01-01 | Diversifying top-κ results | Qin, L; Yu, JX; Chang, L |
| 2015-05-27 | Divide & conquer: I/O efficient depth-first search | Zhang, Z; Yu, JX; Qin, L; Shang, Z |
| 2017-05-01 | Efficient Algorithms for the Identification of Top-k Structural Hole Spanners in Large Social Networks | Xu, W; Rezvani, M; Liang, W; Yu, JX; Liu, C |
| 2016-06-26 | Efficient and progressive Group Steiner Tree search | Li, RH; Qin, L; Yu, JX; Mao, R |
| 2018-11-01 | Efficient Detection of Overlapping Communities Using Asymmetric Triangle Cuts | Rezvani, M; Liang, W; Liu, C; Yu, JX |
| 2017-07-01 | Efficient distance-based representative skyline computation in 2D space | Mao, R; Cai, T; Li, RH; Yu, JX; Li, J |
| 2017-01-01 | Efficient local clustering coefficient estimation in massive graphs | Zhang, H; Zhu, Y; Qin, L; Cheng, H; Yu, JX |
| 2017-01-01 | Efficient Sensitivity Analysis for Inequality Queries in Probabilistic Databases | Qin, B; Yu, JX |
| 2018-01-01 | Efficient Signed Clique Search in Signed Networks | Li, R-H; Dai, Q; Qin, L; Wang, G; Xiao, X; Yu, JX; Qiao, S |
| 2004-09-03 | An efficient strategy for mining exceptions in multi-databases | Zhang, S; Zhang, C; Yu, JX |
| 2019-10-01 | Efficient Structural Clustering on Probabilistic Graphs | Qiu, YX; Li, RH; Li, J; Qiao, S; Wang, G; Yu, JX; Mao, R |
| 2016-01-01 | Efficient triangle listing for billion-scale graphs | Zhang, H; Zhu, Y; Qin, L; Cheng, H; Yu, JX |
| 2013-01-01 | Efficiently computing k-edge connected components via graph decomposition | Chang, L; Yu, JX; Qin, L; Lin, X; Liu, C; Liang, W |
| 2015-01-01 | Efficiently computing Top-K shortest path join | Chang, L; Lin, X; Qin, L; Yu, JX; Pei, J |
| 2012-01-01 | The exact distance to destination in undirected world | Chang, L; Yu, JX; Qin, L; Cheng, H; Qiao, M |
| 2018-02-01 | Exploring Triangle-Free Dense Structures | Lu, C; Yu, JX; Wei, H |
