Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Dinusha Vatsalan, Peter Christen, Erhard Rahm. Scalable Privacy-Preserving Linking of Multiple Databases Using Counting Bloom Filters. In Carlotta Domeniconi, Francesco Gullo, Francesco Bonchi, Josep Domingo-Ferrer, Ricardo A. Baeza-Yates, Zhi-Hua Zhou, Xindong Wu, editors, IEEE International Conference on Data Mining Workshops, ICDM Workshops 2016, December 12-15, 2016, Barcelona, Spain. pages 882-889, IEEE, 2016. [doi]

This author has not been identified. Look up 'Dinusha Vatsalan' in GoogleThis author has not been identified. Look up 'Peter Christen' in GoogleThis author has not been identified. Look up 'Erhard Rahm' in Google

runs on WebDSL