Travelled to:1 × Canada
1 × France
1 × Greece
2 × USA
Collaborated with:J.Gao D.Yang B.Yang X.Jiang R.Jin J.Zhou J.X.Yu S.Tang J.Pei J.Sun Z.Chen H.Qiu Y.Wu H.Wu K.Liu
Talks about:shortest (3) discoveri (2) effect (2) mobil (2) graph (2) path (2) neighborhood (1) communic (1) approach (1) protect (1)
Person: Tengjiao Wang
DBLP: Wang:Tengjiao
Contributed to:
2011
2011
2010
200920092002Wrote 6 papers:
- VLDB-2012-GaoJZYJW11 #approach #graph #relational #scalability
- Relational Approach for Shortest Path Discovery over Large Graphs (JG, RJ, JZ, JXY, XJ, TW), pp. 358–369.
- SIGMOD-2011-GaoYJZWY #distance #privacy
- Neighborhood-privacy protected shortest distance computing in cloud (JG, JXY, RJ, JZ, TW, DY), pp. 409–420.
- CIKM-2010-GaoQJWY #graph #performance
- Fast top-k simple shortest paths discovery in graphs (JG, HQ, XJ, TW, DY), pp. 509–518.
- KDD-2009-YangSWC #classification #effectiveness #learning #multi
- Effective multi-label active learning for text classification (BY, JTS, TW, ZC), pp. 917–926.
- SIGMOD-2009-WangYGYTWLP #case study #communication #data mining #mining #mobile #named
- MobileMiner: a real world case study of data mining in mobile communication (TW, BY, JG, DY, ST, HW, KL, JP), pp. 1083–1086.
- SIGMOD-2002-WangTYGWP #effectiveness #information management #integration #named #query #towards #web
- COMMIX: towards effective web information extraction, integration and query answering (TW, ST, DY, JG, YW, JP), p. 620.