CORR
2007
Springer
13 years 7 months ago
2007
Springer
A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in pro...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
This paper presents a methodology to efficiently explore the design space of communication adapters. In most digital signal processing (DSP) applications, the overall performance ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Deployment of distributed applications on large systems, and especially on grid infrastructures, becomes a more and more complex task. Grid users spend a lot of time to prepare, in...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
E-Laboratories are important components of elearning environments, especially in scientific and technical disciplines. First widespread E-Labs consisted in proposing simulations o...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A multiple input multiple output (MIMO) two-way relay channel is considered, where two sources want to exchange messages with each other using multiple relay nodes, and both the s...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which ca...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...