854 search results - page 111 / 171 » Abstracting from Failure Probabilities |
134
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
125
click to vote
ICIC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. As the information in the internet proliferates, the methods for effectively providing the information have been exploited, especially in conversational agents. Bayesian ...
107
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show tha...
145
click to vote
ISMIS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper centers on a novel data mining technique we term supervised clustering. Unlike traditional clustering, supervised clustering is applied to classified examples ...
152
click to vote
AUSAI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The algorithm selection problem aims to select the best algorithm for an input problem instance according to some characteristics of the instance. This paper presents a l...