Sciweavers

CORR
2008
Springer
80views Education» more  CORR 2008»
13 years 8 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Security for Wiretap Networks via Rank-Metric Codes
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from s...
Danilo Silva, Frank R. Kschischang
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 8 months ago
Branching proofs of infeasibility in low density subset sum problems
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
Gábor Pataki, Mustafa Tural
CORR
2008
Springer
73views Education» more  CORR 2008»
13 years 8 months ago
On acceptance conditions for membrane systems: characterisations of L and NL
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...
Niall Murphy, Damien Woods
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 9 months ago
Playing With Population Protocols
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous ...
Olivier Bournez, Jérémie Chalopin, J...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 10 months ago
Self-Assembly of Infinite Structures
We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile as...
Matthew J. Patitz, Scott M. Summers
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 10 months ago
Communications in cellular automata
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapap...
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
A Particular Universal Cellular Automaton
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...
Nicolas Ollinger, Gaétan Richard
CORR
2008
Springer
94views Education» more  CORR 2008»
13 years 10 months ago
Small Turing universal signal machines
geometrical computation 4: small Turing universal signal machines J
Jérôme Durand-Lose
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
Intrinsically Universal Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Nicolas Ollinger