Privacy-preserving linear and nonlinear approximation via linear programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1497419 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Information and Communications Security
- Massive data classification via unconstrained support vector machines
- The rank of a random matrix
Cited in
(11)- Beating randomized response on incoherent matrices
- scientific article; zbMATH DE number 6402149 (Why is no real title available?)
- Privacy-preserving horizontally partitioned linear programs
- Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy
- Private approximation of search problems
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- On differentially private low rank approximation
- Private Approximation of Search Problems
- Privacy-preserving horizontally partitioned linear programs with inequality constraints
- A framework with randomized encoding for a fast privacy preserving calculation of non-linear kernels for machine learning applications in precision medicine
- scientific article; zbMATH DE number 2222198 (Why is no real title available?)
This page was built for publication: Privacy-preserving linear and nonlinear approximation via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924111)