activity
20042017
most citedA sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

14 citations · 32 across the 5 of their papers we have counts for

collaborators

5 papers

stat.ML2017★ 4 cited

Canonical Correlation Analysis for Analyzing Sequences of Medical Billing Codes

Corinne L. Jones, Sham M. Kakade, Lucas W. Thornblade +2

We propose using canonical correlation analysis (CCA) to generate features from sequences of medical billing codes. Applying this novel use of CCA to a database of medical billing…

math.PR2009

On the diameter of the set of satisfying assignments in random satisfiable k-CNF formulas

Uriel Feige, Abraham D. Flaxman, Dan Vilenchik

It is known that random k-CNF formulas have a so-called satisfiability threshold at a density (namely, clause-variable ratio) of roughly 2^k\ln 2: at densities slightly below this…

math.PR2008★ 14 cited

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

Omer Angel, Abraham D. Flaxman, David B. Wilson

In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)…

physics.soc-ph2007★ 2 cited

Bias reduction in traceroute sampling: towards a more accurate map of the Internet

Abraham D. Flaxman, Juan Vera

Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati…

cs.LG2004★ 12 cited

Online convex optimization in the bandit setting: gradient descent without a gradient

Abraham D. Flaxman, Adam Tauman Kalai, H. Brendan McMahan

We consider a the general online convex optimization framework introduced by Zinkevich. In this setting, there is a sequence of convex functions. Each period, we must choose a sign…