Sciweavers

452 search results - page 64 / 91
» date 2010
Sort
View
TOG
2010
153views more  TOG 2010»
14 years 6 months ago
Content-adaptive parallax barriers: optimizing dual-layer 3D displays using low-rank light field factorization
We optimize automultiscopic displays built by stacking a pair of modified LCD panels. To date, such dual-stacked LCDs have used heuristic parallax barriers for view-dependent imag...
Douglas Lanman, Matthew Hirsch, Yunhee Kim, Ramesh...
PLDI
2010
ACM
15 years 4 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
ICS
2010
Tsinghua U.
15 years 3 months ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat
DCC
2010
IEEE
15 years 6 months ago
A New Searchable Variable-to-Variable Compressor
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
Nieves R. Brisaboa, Antonio Fariña, Juan-Ra...
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
15 years 9 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams