Sciweavers

336 search results - page 44 / 68
» Compression of Samplable Sources
Sort
View
CSMR
2010
IEEE
13 years 2 months ago
A Heuristic-Based Approach to Identify Concepts in Execution Traces
Abstract--Concept or feature identification, i.e., the identification of the source code fragments implementing a particular feature, is a crucial task during software understandin...
Fatemeh Asadi, Massimiliano Di Penta, Giuliano Ant...
DCC
2000
IEEE
13 years 12 months ago
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
Nedeljko Varnica, Michael Fleming, Michelle Effros
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 7 months ago
Rate-Distortion via Markov Chain Monte Carlo
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
Shirin Jalali, Tsachy Weissman
RAID
1999
Springer
13 years 11 months ago
Audit logs: to keep or not to keep?
We approached this line of inquiry by questioning the conventional wisdom that audit logs are too large to be analyzed and must be reduced and filtered before the data can be anal...
Christopher Wee
TCSV
2002
148views more  TCSV 2002»
13 years 7 months ago
A full-featured, error-resilient, scalable wavelet video codec based on the set partitioning in hierarchical trees (SPIHT) algor
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...
Sungdae Cho, William A. Pearlman