Sciweavers

140 search results - page 8 / 28
» soda 2010
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 7 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
SODA
2010
ACM
115views Algorithms» more  SODA 2010»
13 years 8 months ago
Inapproximability for VCG-Based Combinatorial Auctions
David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kl...
ISLPED
2010
ACM
234views Hardware» more  ISLPED 2010»
13 years 8 months ago
Diet SODA: a power-efficient processor for digital cameras
Power has become the most critical design constraint for embedded handheld devices. This paper proposes a power-efficient SIMD architecture, referred to as Diet SODA, for DSP appl...
Sangwon Seo, Ronald G. Dreslinski, Mark Woh, Chait...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 7 months ago
Lower Bounds for Testing Triangle-freeness in Boolean Functions
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
Arnab Bhattacharyya, Ning Xie
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 7 months ago
Lower Bounds for Sparse Recovery
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
khanh do ba, piotr indyk, eric price