Sciweavers

545 search results - page 79 / 109
» Estimating the Probability of Approximate Matches
Sort
View
DCC
2004
IEEE
16 years 5 months ago
On the Entropy of a Hidden Markov Process
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
Philippe Jacquet, Gadiel Seroussi, Wojciech Szpank...
P2P
2009
IEEE
137views Communications» more  P2P 2009»
16 years 22 days ago
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems
Abstract—Peer-to-peer storage systems aim to provide a reliable long-term storage at low cost. In such systems, peers fail continuously, hence, the necessity of self-repairing me...
Olivier Dalle, Frédéric Giroire, Jul...
ALGOSENSORS
2007
Springer
15 years 10 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
CISS
2008
IEEE
15 years 8 months ago
On the frame error rate of transmission schemes on quasi-static fading channels
It is known that the frame error rate of turbo codes on quasi-static fading channels can be accurately approximated using the convergence threshold of the corresponding iterative d...
Ioannis Chatzigeorgiou, Ian J. Wassell, Rolando A....
ICASSP
2010
IEEE
15 years 6 months ago
Optimal delayed decoding of predictively encoded sources
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
Vinay Melkote, Kenneth Rose