CORR
2006
Springer
13 years 8 months ago
2006
Springer
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
: In this paper, our aim is to propose a model that helps in the efficient use of an information system by users, within the organization represented by the IS, in order to resolve...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive proper...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We present a tool that, from automatically recognised names, tries to infer inter-person relations in order to present associated people on maps. Based on an in-house Named Entity...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Our understanding of information in systems has been based on the foundation of memoryless processes. Extensions to stable Markov and auto-regressive processes are classical. Berg...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function R(D), then we can transmit this source to within a distortion D. We answer th...