CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
As the size of data storing arrays of disks grows, it becomes vital to protect data against double disk failures. An economic way of providing such protection consists of adding tw...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
CORR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable a...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. It is therefore important to gain a complete understanding of how these protocols b...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
13 years 11 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
