Sciweavers

170 search results - page 24 / 34
» Constructing Small-Bias Sets from Algebraic-Geometric Codes
Sort
View
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 11 hour ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
PLDI
2010
ACM
15 years 4 months ago
Mint: Java multi-stage programming using weak separability
Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the ov...
Edwin Westbrook, Mathias Ricken, Jun Inoue, Yilong...
3DIM
2007
IEEE
15 years 6 months ago
Surround Structured Lighting for Full Object Scanning
This paper presents a new system for acquiring complete 3D surface models using a single structured light projector, a pair of planar mirrors, and one or more synchronized cameras...
Douglas Lanman, Daniel E. Crispell, Gabriel Taubin
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 3 months ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...
TIT
2002
90views more  TIT 2002»
14 years 11 months ago
Optimal sequences for CDMA under colored noise: A Schur-saddle function property
We consider direct sequence code division multiple access (DS-CDMA), modeling interference from users communicating with neighboring base stations by additive colored noise. We con...
Pramod Viswanath, Venkat Anantharam