189 search results - page 7 / 38 » On the success of network inference using a markov routing m... |
NDSS
2009
IEEE
14 years 2 months ago
2009
IEEE
SybilInfer is an algorithm for labelling nodes in a social network as honest users or Sybils controlled by an adversary. At the heart of SybilInfer lies a probabilistic model of h...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...
HYBRID
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Switching linear dynamic systems (SLDS) attempt to describe a complex nonlinear dynamic system with a succession of linear models indexed by a switching variable. Unfortu...
ICFEM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We develop a way of analyzing the behavior of systems modeled using Discrete Time Markov Chains (DTMC). Specifically, we define iLTL, an LTL with linear inequalities on...
SENSYS
2003
ACM
14 years 26 days ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...