113 search results - page 1 / 23 » Data structures with dynamical random transitions |
RSA
2006
13 years 5 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
JDA
2006
13 years 5 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
ICDM
2009
IEEE
14 years 1 hour ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
SIAMCOMP
1998
13 years 5 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
ACRI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We outline the basic principles of neuropercolation, a generalized percolation model motivated by the dynamical properties of the neuropil, the densely interconnected neu...