4007 search results - page 260 / 802 » Computation with imprecise probabilities |
140
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
116
click to vote
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
118
click to vote
PAM
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a study of the errors observed when an optical Gigabit Ethernet link is subject to attenuation. We use a set of purpose-built tools which allows us to examine t...
137
click to vote
INDOCRYPT
2003
Springer
15 years 9 months ago
2003
Springer
The RC4 stream cipher is the most widely used software based stream cipher. It is based on a secret internal state of N = 256 bytes and two pointers. This paper proposes an efficie...
129
click to vote
CONCUR
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...