61 search results - page 9 / 13 » Probable Innocence Revisited |
EURONGI
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we propose a new mobility model as an extension of the random walk model. Our proposal gathers mobility patterns with several degrees of randomness, so that both ran...
PODC
2003
ACM
14 years 21 days ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
JOT
2007
13 years 7 months ago
2007
In this column, I summarize the 12 worst of the most common requirements engineering problems I have observed over many years working on and with real projects as a requirements e...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...