BibSLEIGH — James

Travelled to:

1 × Luxembourg
4 × China
9 × USA

Collaborated with:

W.Ng Y.Ke A.W.Fu S.Chu H.Wu Y.Lu J.Wang L.Zhu D.Yan H.Cheng Z.Zhao X.Xiao S.S.Bhowmick S.Huang J.X.Yu J.Liu F.Shang Y.Liu A.Galstyan K.Lerman R.C.Wong W.Lin C.Cheng A.Lu Y.Yang H.L.Lau Z.Xu Y.Wang Z.Shang H.Wang C.Jin B.Choi F.Wei M.Zhou Y.Wu Y.Xu K.Xing Y.Bu

Talks about:

graph (13) queri (9) approach (5) process (5) network (4) effici (4) label (4) larg (4) algorithm (3) databas (3)

Person: James Cheng

DBLP: Cheng:James

Contributed to:

2014

2013

2012

2011

2010

2009

2007

2006

Wrote 26 papers:

VLDB-2015-LuCYW14 #distributed #evaluation #graph #scalability: Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation (YL, JC, DY, HW), pp. 281–292.
CIKM-2014-ShangLCC #analysis #component #robust: Robust Principal Component Analysis with Missing Data (FS, YL, JC, HC), pp. 1149–1158.
CIKM-2014-ZhaoCN #approach #data type #probability: Truth Discovery in Data Streams: A Single-Pass Probabilistic Approach (ZZ, JC, WN), pp. 1589–1598.
CIKM-2014-ZhaoCWZNW #named #social: SocialTransfer: Transferring Social Knowledge for Cold-Start Cowdsourcing (ZZ, JC, FW, MZ, WN, YW), pp. 779–788.
SIGMOD-2014-ZhuGCL #analysis #clustering #graph #sentiment #social #social media: Tripartite graph clustering for dynamic sentiment analysis on social media (LZ, AG, JC, KL), pp. 1531–1542.
VLDB-2014-WuCHKLX #graph #problem: Path Problems in Temporal Graphs (HW, JC, SH, YK, YL, YX), pp. 721–732.
VLDB-2014-YanCLN #distributed #framework #graph #named: Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs (DY, JC, YL, WN), pp. 1981–1992.
VLDB-2014-YanCXLNB #algorithm #graph #performance #problem: Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees (DY, JC, KX, YL, WN, YB), pp. 1821–1832.
KDD-2013-WangCF #clique: Redundancy-aware maximal cliques (JW, JC, AWCF), pp. 122–130.
SIGMOD-2013-ChengHWF #graph #named #query #reachability #scalability: TF-Label: a topological-folding labeling scheme for reachability querying in a large graph (JC, SH, HW, AWCF), pp. 193–204.
VLDB-2013-FuWCW #distance #named #query: IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying (AWCF, HW, JC, RCWW), pp. 457–468.
CIKM-2012-LinXCB #algorithm #performance #query: Efficient algorithms for generalized subgraph query processing (WL, XX, JC, SSB), pp. 325–334.
KDD-2012-ChengZKC #algorithm #clique #memory management #performance: Fast algorithms for maximal clique enumeration with limited memory (JC, LZ, YK, SC), pp. 1240–1248.
SIGMOD-2012-ChengKCC #approach #distance #graph #performance #query #scalability: Efficient processing of distance queries in large graphs: a vertex cover approach (JC, YK, SC, CC), pp. 457–468.
SIGMOD-2012-XuKWCC #approach #clustering #graph #modelling: A model-based approach to attributed graph clustering (ZX, YK, YW, HC, JC), pp. 505–516.
VLDB-2012-ChengSCWY #named: K-Reach: Who is in Your Small World (JC, ZS, HC, HW, JXY), pp. 1292–1303.
VLDB-2012-WangC #composition #network: Truss Decomposition in Massive Networks (JW, JC), pp. 812–823.
KDD-2011-ChuC #network: Triangle listing in massive networks and its applications (SC, JC), pp. 672–680.
SIGMOD-2010-ChengFL #morphism #named #network #privacy: K-isomorphism: privacy preserving network publication against structural attacks (JC, AWCF, JL), pp. 459–470.
SIGMOD-2010-ChengKFYZ #clique #network: Finding maximal cliques in massive networks by H*-graph (JC, YK, AWCF, JXY, LZ), pp. 447–458.
SIGMOD-2010-JinBXCC #database #graph #named #query #towards #visual notation: GBLENDER: towards blending visual query formulation and query processing in graph databases (CJ, SSB, XX, JC, BC), pp. 111–122.
CIKM-2009-ChengKN #graph #performance #query #scalability: Efficient processing of group-oriented connection queries in a large graph (JC, YK, WN), pp. 1481–1484.
KDD-2007-KeCN #correlation #database #graph: Correlation search in graph databases (YK, JC, WN), pp. 390–399.
SIGMOD-2007-ChengKNL #database #graph #named #query #towards: Fg-index: towards verification-free query processing on graph databases (JC, YK, WN, AL), pp. 857–872.
CAiSE-2006-YangNLC #approach #outsourcing #performance #query #xml: An Efficient Approach to Support Querying Secure Outsourced XML Information (YY, WN, HLL, JC), pp. 157–171.
KDD-2006-KeCN #approach #correlation #mining #using: Mining quantitative correlated patterns using an information-theoretic approach (YK, JC, WN), pp. 227–236.