Sciweavers

Share
17 search results - page 1 / 4
» Continuum limits for classical sequential growth models
Sort
View
RSA
2010
107views more  RSA 2010»
11 years 4 months ago
Continuum limits for classical sequential growth models
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...
Graham Brightwell, Nicholas Georgiou
IDA
2003
Springer
11 years 10 months ago
Very Predictive Ngrams for Space-Limited Probabilistic Models
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...
Paul R. Cohen, Charles A. Sutton
ITA
2007
11 years 5 months ago
Three notes on the complexity of model checking fixpoint logic with chop
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...
Martin Lange
IPPS
1999
IEEE
11 years 10 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
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...
Keqin Li, Xian-He Sun
CORR
2007
Springer
150views Education» more  CORR 2007»
11 years 5 months ago
Composable Security in the Bounded-Quantum-Storage Model
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...
Stephanie Wehner, Jürg Wullschleger
books