Sciweavers

16 search results - page 3 / 4
» Benchmarking Coding Algorithms for the R-tree Compression
Sort
View
ICIP
2009
IEEE
14 years 6 months ago
Selective And Scalable Encryption Of Enhancement Layers For Dyadic Scalable H.264/avc By Scrambling Of Scan Patterns
This paper presents a new selective and scalable encryption (SSE) method for intra dyadic scalable coding framework based on wavelet/subband (DWTSB) for H.264/AVC. It has been ach...
POPL
2007
ACM
14 years 5 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
CASES
2007
ACM
13 years 9 months ago
Stack size reduction of recursive programs
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...
Stefan Schäckeler, Weijia Shang
CASES
2006
ACM
13 years 11 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
IJCNN
2007
IEEE
13 years 11 months ago
Default ARTMAP 2
—Default ARTMAP combines winner-take-all category node activation during training, distributed activation during testing, and a set of default parameter values that define a read...
Gregory P. Amis, Gail A. Carpenter