134 citations · 142 across the 3 of their papers we have counts for
3 papers
cs.CR2018★ 134 cited
Faster CryptoNets: Leveraging Sparsity for Real-World Encrypted Inference
Edward Chou, Josh Beal, Daniel Levy +3
Homomorphic encryption enables arbitrary computation over data while it remains encrypted. This privacy-preserving feature is attractive for machine learning, but requires signific…
cs.LG2015★ 1 cited
Clustering by transitive propagation
Vijay Kumar, Dan Levy
We present a global optimization algorithm for clustering data given the ratio of likelihoods that each pair of data points is in the same cluster or in different clusters. To defi…
cs.CC2006★ 7 cited
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
Shmuel Friedland, Daniel Levy
We show that the number of -matching in a given undirected graph is equal to the number of perfect matching of the corresponding graph on an even number of vertices di…