Random Iteration Algorithm for Graph-Directed Sets

14 years 5 months ago

Download drops.dagstuhl.de

Abstract. A random iteration algorithm for graph-directed sets is deﬁned and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtained by this algorithm reﬂect a probability measure which is invariant with respect to the system of contractions with probabilities.

Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide

Real-time Traffic

CCA 2009 | Graph-directed Sets | Probability Measure | Random Iteration Algorithm | Theoretical Computer Science |

claim paper

» Tell me something I dont know randomization strategies for iterative data mining

» Iterative Set Expansion of Named Entities Using the Web

» Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models

» Computations of probabilistic output admissible set for uncertain constrained systems

» Sisa Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data

» Boosting Spectral Partitioning by Sampling and Iteration

» Clustering via Random Walk Hitting Time on Directed Graphs

» Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled ...

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CCA
Authors	Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hideki Tsuiki

Comments (0)

Sciweavers

Random Iteration Algorithm for Graph-Directed Sets

CCA 2009 | Graph-directed Sets | Probability Measure | Random Iteration Algorithm | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers