28 citations · 244 across the 83 of their papers we have counts for
6 papers · 1 filter
Codes for Load Balancing in TCAMs: Size Analysis
Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan
Traffic splitting is a required functionality in networks, for example for load balancing over paths or servers, or by the source's access restrictions. The capacities of the serve…
Differentially-Private Bayes Consistency
Olivier Bousquet, Haim Kaplan, Aryeh Kontorovich +4
We construct a universally Bayes consistent learning rule that satisfies differential privacy (DP). We first handle the setting of binary classification and then extend our rule to…
Fast approximation of search trees on trees with centroid trees
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan +1
Search trees on trees (STTs) generalize the fundamental binary search tree (BST) data structure: in STTs the underlying search space is an arbitrary tree, whereas in BSTs it is a p…
Almost Tight Bounds for Online Facility Location in the Random-Order Model
Haim Kaplan, David Naori, Danny Raz
We study the online facility location problem with uniform facility costs in the random-order model. Meyerson's algorithm [FOCS'01] is arguably the most natural and simple online a…
Expander Decomposition with Fewer Inter-Cluster Edges Using a Spectral Cut Player
Daniel Agassy, Dani Dorfman, Haim Kaplan
A -expander-decomposition of a graph (with vertices and edges) is a partition of into clusters with conductance , such that…
Monotone Learning
Olivier Bousquet, Amit Daniely, Haim Kaplan +3
The amount of training-data is one of the key factors which determines the generalization capacity of learning algorithms. Intuitively, one expects the error rate to decrease as th…