From the 1 of 1.9k papers with an AI index.
24.4k citations
- University of California, BerkeleyUS104 papers
- Stanford UniversityUS89 papers
- Massachusetts Institute of TechnologyUS87 papers
- Carnegie Mellon UniversityUS64 papers
- Google DeepMind (United Kingdom)GB64 papers
- University of TorontoCA59 papers
- Cornell UniversityUS57 papers
- Princeton UniversityUS57 papers
- University of Illinois Urbana-ChampaignUS49 papers
- University of California, Santa BarbaraUS42 papers
- Columbia UniversityUS41 papers
- University of ChicagoUS40 papers
3 papers · 2 filters
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models
Hossein Esfandiari, Nitish Korula, Vahab Mirrokni
Motivated by Internet advertising applications, online allocation problems have been studied extensively in various adversarial and stochastic models. While the adversarial arrival…
Decremental Single-Source Reachability in Planar Digraphs
Giuseppe F. Italiano, Adam Karczmarz, Jakub Łącki +1
In this paper we show a new algorithm for the decremental single-source reachability problem in directed planar graphs. It processes any sequence of edge deletions in $O(n\log^2{n}…
Algorithms for Low Rank Approximation
Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar +3
We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise -approximation error, for any ; the case is t…