#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2007

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet
- ITCS
- 2013

We introduce the notion of <i>restricted sensitivity</i> as an alternative to global and smooth sensitivity to improve accuracy in differentially private data analysis. The definition of restricted sensitivity is similar to that of global sensitivity except that instead of quantifying over all possible datasets, we take advantage of any beliefs about the… (More)

- Pranjal Awasthi, Avrim Blum, Or Sheffet
- Inf. Process. Lett.
- 2012

Clustering under most popular objective functions is NP-hard, even to approximate well, and so unlikely to be efficiently solvable in the worst case. Recently, Bilu and Linial [11] suggested an approach aimed at bypassing this computational barrier by using properties of instances one might hope to hold in practice. In particular, they argue that instances… (More)

- Peter Bro Miltersen, Or Sheffet
- EC
- 2012

Emek et al presented a model of probabilistic single-item second price auctions where an auctioneer who is informed about the type of an item for sale, broadcasts a signal about this type to uninformed bidders. They proved that finding the optimal (for the purpose of generating revenue) <i>pure</i> signaling scheme is strongly NP-hard. In contrast, we prove… (More)

- Pranjal Awasthi, Avrim Blum, Or Sheffet
- 2010 IEEE 51st Annual Symposium on Foundations of…
- 2010

We consider $k$-median clustering in finite metric spaces and $k$-means clustering in Euclidean spaces, in the setting where $k$ is part of the input (not a constant). For the $k$-means problem, Ostrovsky et al. show that if the optimal $(k-1)$-means clustering of the input is more expensive than the optimal $k$-means clustering by a factor of… (More)

We adopt a utilitarian perspective on social choice, assuming that agents have (possibly latent) utility functions over some space of alternatives. For many reasons one might consider mechanisms, or <i>social choice functions</i>, that only have access to the ordinal rankings of alternatives by the individual agents rather than their utility functions. In… (More)

- Pranjal Awasthi, Or Sheffet
- APPROX-RANDOM
- 2012

Aiming to unify known results about clustering mixtures of distributions under separation conditions, Kumar and Kannan [KK10] introduced a deterministic condition for clustering datasets. They showed that this single deterministic condition encompasses many previously studied clustering assumptions. More specifically, their proximity condition requires that… (More)

Probabilistic modeling of ranking data is an extensively studied problem with applications ranging from understanding user preferences in electoral systems and social choice theory, to more modern learning tasks in online web search, crowd-sourcing and recommendation systems. This work concerns learning the Mallows model – one of the most popular… (More)

- Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet
- 2012 IEEE 53rd Annual Symposium on Foundations of…
- 2012

This paper proves that an "old dog", namely - the classical Johnson-Lindenstrauss transform, "performs new tricks" - it gives a novel way of preserving differential privacy. We show that if we take two databases, D and D', such that (i) D'-D is a rank-1 matrix of bounded norm and (ii) all singular values of D and D' are sufficiently large, then multiplying… (More)

- Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos
- Electronic Notes in Discrete Mathematics
- 2007

For a graph G and an integer t we let mcc t (G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having more than m vertices. Let F be any nontrivial minor-closed family of graphs. We show that mcc 2 (G) = O(n 2/3) for any n-vertex graph G ∈ F. This bound is asymptotically optimal… (More)

- Pranjal Awasthi, Avrim Blum, Or Sheffet
- COLT
- 2010

Given some arbitrary distribution D over {0, 1} n and arbitrary target function c * , the problem of agnostic learning of disjunctions is to achieve an error rate comparable to the error OPT disj of the best disjunction with respect to (D, c *). Achieving error O(n · OPT disj) + ǫ is trivial, and Winnow [13] achieves error O(r · OPT disj) + ǫ, where r is… (More)