#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2012

2018

- This year (3)
- Last 5 years (13)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Michael Dinitz, Robert Krauthgamer, Tal Wagner
- APPROX-RANDOM
- 2015

We study resistance sparsification of graphs, in which the goal is to find a sparse subgraph (with reweighted edges) that approximately preserves the effective resistances between every pair ofâ€¦ (More)

- Piotr Indyk, Tal Wagner
- SODA
- 2017

The metric sketching problem is defined as follows. Given a metric on n points, and > 0, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers theâ€¦ (More)

- Uriel Feige, Tal Wagner
- 2013

We study the asymptotic value of several extremal problems on graphs and hypergraphs, that arise as generalized notions of girth. Apart from being combinatorially natural questions, they areâ€¦ (More)

- Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
- NIPS
- 2017

How well can one compress a dataset of points from a high-dimensional space while preserving pairwise distances? Indyk and Wagner have recently obtained almost optimal bounds for this problem, butâ€¦ (More)

- Tal Wagner, Eric Schkufza, Udi Wieder
- SPLASH
- 2016

Log management systems are common in industry and an essential part of a system administratorâ€™s toolkit. Examples include Splunk, elk, Log Insight, Sexilog, and more. Logs in these systems areâ€¦ (More)

- Piotr Indyk, Tal Wagner
- COLT
- 2018

We consider the (1 + )-approximate nearest neighbor search problem: given a set X of n points in a d-dimensional space, build a data structure that, given any query point y, finds a point x âˆˆ X whoseâ€¦ (More)

- Jonathan D. Cohen, Biswadip Dey, +5 authors Tal Wagner
- NIPS
- 2017

A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representations. However, how theâ€¦ (More)

- Koby Crammer, Tal Wagner
- NIPS
- 2012

We introduce a large-volume box classification for binary prediction, which maintains a subset of weight vectors, and specifically axis-aligned boxes. Our learning algorithm seeks for a box of largeâ€¦ (More)

- Dean Doron, Ilan Komargodski, +10 authors Eylon Yogev
- 2013

Preface A couple of years ago, Ryan Williams settled a long standing open problem by showing that NEXP âŠ‚ ACC 0. To obtain this result, Williams applied an abundant of classical as well as more recentâ€¦ (More)

- Robert Krauthgamer, Tal Wagner
- ACM Trans. Algorithms
- 2016

We introduce the st-cut version of the sparsest-cut problem, where the goal is to find a cut of minimum sparsity in a graph G(V, E) among those separating two distinguished vertices s, t âˆˆ V.â€¦ (More)