Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Privacy-preserving_computational_geometry> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Privacy-preserving_computational_geometry abstract "Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull, and more.A pioneering work in this area was a 2001 paper by Atallah and Du, in which the secure point in polygon inclusion and polygonal intersection problems were considered. Other problems are computation of the distance between two private points and secure two-party point-circle inclusion problem.".
- Privacy-preserving_computational_geometry wikiPageID "41056398".
- Privacy-preserving_computational_geometry wikiPageRevisionID "582730522".
- Privacy-preserving_computational_geometry subject Category:Computational_geometry.
- Privacy-preserving_computational_geometry subject Category:Theory_of_cryptography.
- Privacy-preserving_computational_geometry comment "Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry.".
- Privacy-preserving_computational_geometry label "Privacy-preserving computational geometry".
- Privacy-preserving_computational_geometry sameAs m.0z6tpw0.
- Privacy-preserving_computational_geometry sameAs Q17083472.
- Privacy-preserving_computational_geometry sameAs Q17083472.
- Privacy-preserving_computational_geometry wasDerivedFrom Privacy-preserving_computational_geometry?oldid=582730522.
- Privacy-preserving_computational_geometry isPrimaryTopicOf Privacy-preserving_computational_geometry.