The top documents tagged [approximation factor]

VLSH: Voronoi-based Locality Sensitive Hashing Sung-eui Yoon Authors: Lin Loi, Jae-Pil Heo, Junghwan Lee, and Sung-Eui Yoon KAIST
Documents VLSH: Voronoi-based Locality Sensitive Hashing Sung-eui Yoon Authors: Lin Loi, Jae-Pil Heo, Junghwan Lee, and Sung-Eui Yoon KAIST

219 views

Learning Submodular Functions Nick Harvey University of Waterloo Joint work with Nina Balcan, Georgia Tech
Documents Learning Submodular Functions Nick Harvey University of Waterloo Joint work with Nina Balcan, Georgia Tech

213 views

On Computing Compression Trees for Data Collection in Wireless Sensor Networks Jian Li, Amol Deshpande and Samir Khuller Department of Computer Science,
Documents On Computing Compression Trees for Data Collection in Wireless Sensor Networks Jian Li, Amol Deshpande and Samir Khuller Department of Computer Science,

214 views

E. AlthausMax-Plank-Institut fur Informatik G. CalinescuIllinois Institute of Technology I.I. MandoiuUC San Diego S. Prasad Georgia State University N
Documents E. AlthausMax-Plank-Institut fur Informatik G. CalinescuIllinois Institute of Technology I.I. MandoiuUC San Diego S. Prasad Georgia State University N

214 views

Non-myopic Informative Path Planning in Spatio-Temporal Models Alexandra Meliou Andreas Krause Carlos Guestrin Joe Hellerstein
Documents Non-myopic Informative Path Planning in Spatio-Temporal Models Alexandra Meliou Andreas Krause Carlos Guestrin Joe Hellerstein

214 views

Submodular Functions Learnability, Structure & Optimization Nick Harvey, UBC CS Maria-Florina Balcan, Georgia Tech
Documents Submodular Functions Learnability, Structure & Optimization Nick Harvey, UBC CS Maria-Florina Balcan, Georgia Tech

224 views

1 Combinatorial Algorithms Parametric Pruning. 2 Metric k-center Given a complete undirected graph G = (V, E) with nonnegative edge costs satisfying the
Documents 1 Combinatorial Algorithms Parametric Pruning. 2 Metric k-center Given a complete undirected graph G = (V, E) with nonnegative edge costs satisfying the

223 views

University of Denver Department of Mathematics Department of Computer Science
Documents University of Denver Department of Mathematics Department of Computer Science

24 views

PCP and Inapproximability Irit Dinur NEC. Example: the Minimum Vertex Cover functionExample: the Minimum Vertex Cover function Facts: 1. Best algorithm
Documents PCP and Inapproximability Irit Dinur NEC. Example: the Minimum Vertex Cover functionExample: the Minimum Vertex Cover function Facts: 1. Best algorithm

220 views

P robabilistically C heckable P roofs (and inapproximability)
Documents P robabilistically C heckable P roofs (and inapproximability)

29 views

Submodular Functions Learnability , Structure & Optimization
Documents Submodular Functions Learnability , Structure & Optimization

62 views

Vijay V. Vazirani Georgia Tech A Postmortem of the Last Decade and Some Directions for the Future
Documents Vijay V. Vazirani Georgia Tech A Postmortem of the Last Decade and Some Directions for the Future

218 views