CORR
2008
Springer
13 years 11 months ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
CORR
2008
Springer
13 years 11 months ago
2008
Springer
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-free...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
paper we will discuss the design of abstract firewall model along with platform-independent policy definition language. We will also discuss the main design challenges and solutio...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Jointly Gaussian memoryless sources are observed at N distinct terminals. The goal is to efficiently encode the observations in a distributed fashion so as to enable reconstruction...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed the experiments in proof assistant Coq that are reported here.
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...