POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell Whitley. POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice. In David Wai-Lok Cheung, Il-Yeol Song, Wesley W. Chu, Xiaohua Hu, Jimmy J. Lin, editors, Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009. pages 1037-1046, ACM, 2009. [doi]

This author has not been identified. Look up 'Rinku Dewri' in GoogleThis author has not been identified. Look up 'Indrajit Ray' in GoogleThis author has not been identified. Look up 'Indrakshi Ray' in GoogleThis author has not been identified. Look up 'Darrell Whitley' in Google

runs on WebDSL