CDC
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
CORR
2011
Springer
13 years 7 months ago
2011
Springer
: We study a simple general scenario of ad hoc networks based on IEEE 802.11 wireless communications, consisting in a chain of transmitters, each of them being in the carrier sense...
ICWSM
2009
13 years 10 months ago
2009
Whether they are modeling bookmarking behavior in Flickr or cascades of failure in large networks, models of diffusion often start with the assumption that a few nodes start long ...
ORDER
2007
13 years 12 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
SIAMCOMP
2002
14 years 2 days ago
2002
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
SIAMAM
2000
14 years 6 days ago
2000
A nonlinear multiscale technique is used to describe the time history of a spatially homogeneous chain-branching/chain-breaking explosion when chain branching is much faster than c...
JAL
2000
14 years 6 days ago
2000
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and Vigoda described a rapidly mixing Markov chain for...
CORR
2002
Springer
14 years 7 days ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
AI
2004
Springer
14 years 9 days ago
2004
Springer
Orderings and inference relations can be successfully used to model the behavior of a rational agent. This behavior is indeed represented either by a set of ordered pairs that ref...
TIT
2008
14 years 10 days ago
2008
We develop a couple of new methods to reduce transmission overheads in broadcast encryption. The methods are based on the idea of assigning one key per each partition using one-way...