17 search results - page 1 / 4 » Continuum limits for classical sequential growth models |
RSA
2010
14 years 7 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
66
Voted
IDA
2003
Springer
15 years 2 months ago
2003
Springer
In sequential prediction tasks, one repeatedly tries to predict the next element in a sequence. A classical way to solve these problems is to fit an order-n Markov model to the da...
78
Voted
ITA
2007
14 years 9 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
107
click to vote
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows for sequential composition of protocols. Damg...