117
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
107
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
95
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
117
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
104
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
86
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
The median problem in the weighted Jaccard metric was
102
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional l...
117
Voted
SODA
2010
ACM
16 years 15 hour ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...