107 search results - page 22 / 22 » Lower Bounds for Sparse Recovery |
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
Multimedia similarity search has been playing a critical role in many novel applications. Typically, multimedia objects are described by high-dimensional feature vectors (or point...
ICALP
2011
Springer
12 years 9 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...