CORR
2006
Springer
13 years 6 months ago
2006
Springer
Relying on the idea that back-of-the-book indexes are traditional devices for navigation through large documents, we have developed a method to build a hypertextual network that h...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
CORR
2006
Springer
13 years 6 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Bipolar synchronization systems (BP-systems) constitute a class of coloured Petri nets, well suited for modelling the control flow of discrete dynamical systems. Every BP-system ha...