Sciweavers

10 search results - page 2 / 2
» A Decomposition Theory for Binary Linear Codes
Sort
View
DCC
2005
IEEE
14 years 5 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
ACCV
2006
Springer
13 years 7 months ago
Learning Multi-category Classification in Bayesian Framework
Abstract. We propose an algorithm for Sparse Bayesian Classification for multi-class problems using Automatic Relevance Determination(ARD). Unlike other approaches which treat mult...
Atul Kanaujia, Dimitris N. Metaxas
EXPCS
2007
13 years 9 months ago
An analysis of XML compression efficiency
XML simplifies data exchange among heterogeneous computers, but it is notoriously verbose and has spawned the development of many XML-specific compressors and binary formats. We p...
Christopher J. Augeri, Dursun A. Bulutoglu, Barry ...
TIT
2002
102views more  TIT 2002»
13 years 5 months ago
Asymptotic efficiency of two-stage disjunctive testing
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
Toby Berger, Vladimir I. Levenshtein
CAV
2008
Springer
139views Hardware» more  CAV 2008»
13 years 7 months ago
CSIsat: Interpolation for LA+EUF
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
Dirk Beyer, Damien Zufferey, Rupak Majumdar