Sciweavers

2060 search results - page 66 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
STACS
1993
Springer
15 years 1 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
DCC
2006
IEEE
15 years 9 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...
DCC
2006
IEEE
15 years 9 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey
IPPS
1996
IEEE
15 years 1 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
APSEC
2001
IEEE
15 years 1 months ago
Compilation of Specifications
Computer software now controls critical systems worldwide. International standards require such programs to be produced from mathematically-precise specifications, but the techniq...
Colin J. Fidge