Sciweavers

1060 search results - page 162 / 212
» Notes on Coding Theory
Sort
View
EGH
2011
Springer
13 years 9 months ago
Lossless Compression of Already Compressed Textures
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...
Jacob Ström, Per Wennersten
ECCV
2008
Springer
15 years 11 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....
POPL
2005
ACM
15 years 10 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...
MOBIHOC
2007
ACM
15 years 9 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
DRM
2007
Springer
15 years 3 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...