Author of the publication

Noninteractive Locally Private Learning of Linear Models via Polynomial Approximations.

, , and . ALT, volume 98 of Proceedings of Machine Learning Research, page 897-902. PMLR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Unified Framework for Clustering Constrained Data without Locality Property., and . CoRR, (2018)Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry., , , , and . J. Comb. Optim., 10 (2): 113-132 (2005)Almost Optimal Solutions for Bin Coloring Problems., , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 82-91. Springer, (2005)Efficient Job Scheduling Algorithms with Multi-type Contentions., , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 318-329. Springer, (2004)On the Central Path Problem., and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 138-150. Springer, (2012)Geometric Spanner of Objects under L1 Distance., , , , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 395-404. Springer, (2008)Geometric permutations of high dimensional spheres., , and . SODA, page 244-245. ACM/SIAM, (2001)ABC: A Simple Geographic Forwarding Scheme Capable of Bypassing Routing Holes in Sensor Networks., , , and . ICCCN, page 320-327. IEEE, (2008)An LP rounding algorithm for approximating uncapacitated facility location problem with penalties., and . Inf. Process. Lett., 94 (3): 119-123 (2005)An improved approximation algorithm for uncapacitated facility location problem with penalties., and . J. Comb. Optim., 17 (4): 424-436 (2009)