103 search results - page 9 / 21 » The Cover Time of Random Digraphs |
ISTCS
1993
Springer
13 years 12 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Lecture Notes
The notes cover several topics such as Measure Theory, Discrete Time Martingales, Discrete Time Option Pricing, Continuous Time, Martingales, Stochastic Integrals, Stochastic Calcu...
WSC
2007
13 years 10 months ago
2007
It is well known that trivariate reduction — a method to generate two dependent random variables from three independent random variables — can be used to generate Poisson rand...
DKE
2002
13 years 7 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...