1141 search results - page 212 / 229 » Gray Code Compression |
SIAMSC
2010
13 years 6 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
Software researchers have already developed static code security checkers to parse through and scan source code files, looking for security vulnerabilities [8, 9]. What about exec...
CASES
2007
ACM
13 years 11 months ago
2007
ACM
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
DAM
2008
13 years 7 months ago
2008
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
TIT
2010
13 years 2 months ago
2010
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...