51 search results - page 7 / 11 » Distributed disk-based algorithms for model checking very la... |
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
NIPS
2008
13 years 9 months ago
2008
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
JCB
2007
13 years 7 months ago
2007
Analysis of biopolymer sequences and structures generally adopts one of two approaches: use of detailed biophysical theoretical models of the system with experimentally-determined...
ESORICS
2004
Springer
14 years 1 months ago
2004
Springer
This paper considers iterated ciphers and their resistance against linear and differential cryptanalysis. In the theory of these attacks one assumes independence of the round keys...