Sciweavers

62 search results - page 8 / 13
» Improved Upper Bound for the Redundancy of Fix-Free Codes
Sort
View
GLOBECOM
2008
IEEE
15 years 6 months ago
Distributed Double-Differential Orthogonal Space-Time Coding for Cooperative Networks
— In this paper, distributed double-differential coding is proposed to avoid the problem of carrier offsets in amplify and forward protocol based cooperative network with two rel...
Manav R. Bhatnagar, Are Hjørungnes
ICLP
1989
Springer
15 years 3 months ago
A Simple Code Improvement Scheme for Prolog
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
Saumya K. Debray
DAM
1999
100views more  DAM 1999»
14 years 11 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
DCC
2010
IEEE
15 years 6 months ago
On Computation of Performance Bounds of Optimal Index Assignment
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
Xiaolin Wu, Hans D. Mittelmann, Xiaohan Wang, Jia ...
81
Voted
LPAR
2005
Springer
15 years 5 months ago
Concepts of Automata Construction from LTL
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
Carsten Fritz