15 citations · 45 across the 13 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.DS2009
Algorithms and Hardness for Subspace Approximation
Amit Deshpande, Kasturi Varadarajan, Madhur Tulsiani +1
The subspace approximation problem Subspace(,) asks for a -dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generali…
cs.CG2009
Quasi-Polynomial Time Approximation Schemes for Target Tracking
Matt Gibson, Gaurav Kanade, Erik Krohn +1
We consider the problem of tracking targets in the plane using cameras. We can use two cameras to estimate the location of a target. We are then interested in forming …
cs.CG2009★ 13 cited
Decomposing Coverings and the Planar Sensor Cover Problem
Matt Gibson, Kasturi Varadarajan
We show that a -fold covering using translates of an arbitrary convex polygon can be decomposed into covers (using an efficient algorithm). We generalize this result to o…