FigureSeer: Parsing Result-Figures in Research Papers
- Noah Siegel, Zachary Horvitz, Roie Levin, S. Divvala, Ali Farhadi
- Computer ScienceEuropean Conference on Computer Vision
- 8 October 2016
This paper introduces FigureSeer, an end-to-end framework for parsing result-figures, that enables powerful search and retrieval of results in research papers and formulates a novel graph-based reasoning approach using a CNN-based similarity metric.
Streaming Submodular Matching Meets the Primal-Dual Method
- Roie Levin, David Wajc
- Computer Science, MathematicsACM-SIAM Symposium on Discrete Algorithms
- 23 August 2020
It is shown that the (randomized) primal-dual method, which originated in the study of maximum weight matching (MWM), is also useful in the context of MSM, and this is the first use of primal- dual based analysis for streaming submodular optimization.
The Online Submodular Cover Problem
- Anupam Gupta, Roie Levin
- MathematicsACM-SIAM Symposium on Discrete Algorithms
- 2020
Fully-Dynamic Submodular Cover with Bounded Recourse
- Anupam Gupta, Roie Levin
- Mathematics, Computer ScienceIEEE Annual Symposium on Foundations of Computer…
- 2 September 2020
This work simultaneously simplifies and unifies previous results, as well as generalizes to a significantly larger class of covering problems, which includes set-coverage functions, and extensively uses the idea of Mutual Coverage, which generalizes the classic notion of mutual information.
Beyond Sentential Semantic Parsing: Tackling the Math SAT with a Cascade of Tree Transducers
- Mark Hopkins, Cristian Petrescu-Prahova, Roie Levin, Ronan Le Bras, Alvaro Herrasti, V. Joshi
- Computer ScienceConference on Empirical Methods in Natural…
- 1 September 2017
We present an approach for answering questions that span multiple sentences and exhibit sophisticated cross-sentence anaphoric phenomena, evaluating on a rich source of such questions – the math…
Robust Subspace Approximation in a Stream
- Roie Levin, A. Sevekari, David P. Woodruff
- Computer ScienceNeural Information Processing Systems
- 2018
This work gives the first sublinear approximation algorithm for this problem in the turnstile streaming and arbitrary partition distributed models, achieving the same time guarantees as in the offline case.
Random Order Online Set Cover is as Easy as Offline
- Anupam Gupta, Gregory Kehne, Roie Levin
- Computer Science, MathematicsIEEE Annual Symposium on Foundations of Computer…
- 1 February 2022
A polynomial-time algorithm for Online-SetCover with a competitive ratio of O(\log mn) when the elements are revealed in random order that can be rounded online to achieve the claimed guarantee (in the random order model).
Random Order Set Cover is as Easy as Offline
- Anupam Gupta, Gregory Kehne, Roie Levin
- Computer Science, MathematicsArXiv
- 12 November 2021
We give a polynomial-time algorithm forOnlineSetCover with a competitive ratio ofO(logmn) when the elements are revealed in random order, essentially matching the best possible offline bound of O(log…
PTAS for MAP Assignment on Pairwise Markov Random Fields in Planar Graphs
- Eli Fox-Epstein, Roie Levin, David Meierfrankenfeld
- Computer Science, MathematicsArXiv
- 6 April 2015
We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind…
Competitive Algorithms for Block-Aware Caching
- Christian Coester, Roie Levin, J. Naor, Ohad Talmon
- Computer ScienceACM Symposium on Parallelism in Algorithms and…
- 24 May 2022
This work relaxes the block-aware caching problem to a submodular covering linear program, and establishes a strong separation between the tractability of the fetching and eviction cost models, which is interesting since fetching/eviction costs are the same up to an additive term for the classic caching problem.
...
...