Sciweavers

592 search results - page 32 / 119
» Predicting faults using the complexity of code changes
Sort
View
IPAS
2007
15 years 4 months ago
Prediction of signs of DCT coefficients in block-based lossy image compression
A practical impossibility of prediction of signs of DCT coefficients is generally accepted. Therefore each coded sign of DCT coefficients occupies usually 1 bit of memory in compr...
Nikolay N. Ponomarenko, Andriy V. Bazhyna, Karen O...
KDD
2009
ACM
181views Data Mining» more  KDD 2009»
15 years 9 months ago
An exploration of climate data using complex networks
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...
Karsten Steinhaeuser, Nitesh V. Chawla, Auroop R. ...
DCC
2006
IEEE
16 years 2 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...
126
Voted
RTCSA
2008
IEEE
15 years 8 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
ICIP
2006
IEEE
16 years 4 months ago
On the Modeling of Motion in Wyner-Ziv Video Coding
In the past few years, a number of practical video coding schemes following distributed source coding principles have emerged. One of the main goals of distributed video coding (D...
Marco Tagliasacchi, Stefano Tubaro, Augusto Sarti