Efficient Homomorphic Comparison Methods with Optimal Complexity
Authors:
- 5 December 2020
- book chapter
- Published by Springer Nature
- p. 221-256
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Optimizing Halley's Iteration for Computing the Matrix Polar DecompositionSIAM Journal on Matrix Analysis and Applications, 2010
- Polynomial approximation of piecewise analytic functions on a compact subset of the real lineJournal of Approximation Theory, 2009
- A note on margin-based loss functions in classificationStatistics & Probability Letters, 2004
- Mean shift: a robust approach toward feature space analysisIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
- Stochastic gradient boostingComputational Statistics & Data Analysis, 2002
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001
- The matrix sign functionIEEE Transactions on Automatic Control, 1995
- Polynomial Approximation of Piecewise Analytic FunctionsJournal of the London Mathematical Society, 1989
- Algorithm AS 136: A K-Means Clustering AlgorithmJournal of the Royal Statistical Society Series C: Applied Statistics, 1979
- On the Number of Nonscalar Multiplications Necessary to Evaluate PolynomialsSIAM Journal on Computing, 1973