ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1904.02033
  4. Cited By
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search

SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search

3 April 2019
Hao Chen
Ilaria Chillotti
Yihe Dong
Oxana Poburinnaya
Ilya P. Razenshteyn
M. Riazi
ArXivPDFHTML

Papers citing "SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search"

4 / 4 papers shown
Title
Sublinear Time Algorithm for Online Weighted Bipartite Matching
Sublinear Time Algorithm for Online Weighted Bipartite Matching
Han Hu
Zhao-quan Song
Runzhou Tao
Zhaozhuo Xu
Junze Yin
Danyang Zhuo
23
7
0
05 Aug 2022
Breaking the Linear Iteration Cost Barrier for Some Well-known
  Conditional Gradient Methods Using MaxIP Data-structures
Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures
Anshumali Shrivastava
Zhao-quan Song
Zhaozhuo Xu
25
28
0
30 Nov 2021
KNN Classification with One-step Computation
KNN Classification with One-step Computation
Shichao Zhang
Jiaye Li
9
81
0
09 Dec 2020
Lower Bounds for Oblivious Near-Neighbor Search
Lower Bounds for Oblivious Near-Neighbor Search
Kasper Green Larsen
T. Malkin
Omri Weinstein
Kevin Yeo
13
20
0
09 Apr 2019
1