1.9k citations
- University of ChicagoUS60 papers
- Microsoft (United States)US23 papers
- Carnegie Mellon UniversityUS20 papers
- Massachusetts Institute of TechnologyUS18 papers
- Google (United States)US16 papers
- Technion – Israel Institute of TechnologyIL16 papers
- University of California, BerkeleyUS16 papers
- Princeton UniversityUS12 papers
- The University of Texas at AustinUS12 papers
- Toyota Technological InstituteJP10 papers
- University of TorontoCA10 papers
- University of WashingtonUS10 papers
11 papers · 1 filter
Approximation Algorithms and Hardness of the k-Route Cut Problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan +1
We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivit…
A compiler for variational forms
Robert C. Kirby, Anders Logg
As a key step towards a complete automation of the finite element method, we present a new algorithm for automatic and efficient evaluation of multilinear variational forms. The al…
The Generalized A* Architecture
P. F. Felzenszwalb, D. McAllester
We consider the problem of computing a lightest derivation of a global structure using a set of weighted rules. A large variety of inference problems in AI can be formulated in thi…
On the Universality of Online Mirror Descent
Nathan Srebro, Karthik Sridharan, Ambuj Tewari
We show that for a general class of convex online learning problems, Mirror Descent can always achieve a (nearly) optimal regret guarantee.
On the Caccetta-Haggkvist conjecture with forbidden subgraphs
Alexander Razborov
The Caccetta-Haggkvist conjecture made in 1978 asserts that every orgraph on n vertices without oriented cycles of length <= l must contain a vertex of outdegree at most (n-1)/l. I…
Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions
J. A. Csirik, M. L. Littman, D. McAllester +2
Auctions are becoming an increasingly popular method for transacting business, especially over the Internet. This article presents a general approach to building autonomous bidding…