Author: Kai Wang

Publication Overview

Publication period start: 2011
Number of co-authors: 11

Co-Authors

Number of publications with favourite co-authors

Productive Colleagues

Most productive colleagues in number of publications

Publications

Wang, Kai, Lavoué, Guillaume, Denis, Florence, Baskurt, Atilla (2011): Robust and blind mesh watermarking based on volume moments. In Computers & Graphics, 35 (1) pp. 1-19. https://dx.doi.org/10.1016/j.cag.2010.09.010
Li, Xiong, Wu, Yujin, Wang, Kai, Xu, Zongchang (2006): Concurrent Negotiations for Agent-Based Grid Computing. In: Yao, Yiyu, Shi, Zhongzhi, Wang, Yingxu, Kinsner, Witold (eds.) Proceedings of the Firth IEEE International Conference on Cognitive Informatics ICCI 2006 July 17-19, 2006, Beijing, China. pp. 31-36. https://dx.doi.org/10.1109/COGINF.2006.365673
Ming, Zhao-Yan, Wang, Kai, Chua, Tat-Seng (2010): Prototype hierarchy based clustering for the categorization and navigation of web collecti. In: Proceedings of the 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 2010, . pp. 2-9. https://doi.acm.org/10.1145/1835449.1835453
Wang, Kai, Ming, Zhao-Yan, Hu, Xia, Chua, Tat-Seng (2010): Segmentation of multi-sentence questions: towards effective question retrieval in cQA serv. In: Proceedings of the 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 2010, . pp. 387-394. https://doi.acm.org/10.1145/1835449.1835515
Wang, Kai, Ming, Zhaoyan, Chua, Tat-Seng (2009): A syntactic tree matching approach to finding similar questions in community-based qa serv. In: Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 2009, . pp. 187-194. https://doi.acm.org/10.1145/1571941.1571975
Privacy Settings
By using this site, you accept our Cookie Policy and Terms of Use.
Customize
Accept all

Feel Stuck? Want Freedom?

Join 326,043+ designers who get one powerful email each week. Learn to design a life you love.

Next email in
1
day
3
hrs
21
mins
22
secs

Free forever. No spam. Unsubscribe anytime.