Sciweavers

3384 search results - page 275 / 677
» More Testable Properties
Sort
View
165
Voted
IJAR
2008
76views more  IJAR 2008»
15 years 6 months ago
Evidence and scenario sensitivities in naive Bayesian classifiers
Empirical evidence shows that naive Bayesian classifiers perform quite well compared to more sophisticated network classifiers, even in view of inaccuracies in their parameters. I...
Silja Renooij, Linda C. van der Gaag
ENTCS
2006
123views more  ENTCS 2006»
15 years 6 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
IJNSEC
2008
145views more  IJNSEC 2008»
15 years 6 months ago
Efficient Certificateless Authentication and Key Agreement (CL-AK) for Grid Computing
Most of the current security architectures for grid systems use conventional public key infrastructure (PKI) to authenticate grid members and to secure resource allocation to thes...
Shengbao Wang, Zhenfu Cao, Haiyong Bao
COMGEO
2007
ACM
15 years 6 months ago
An intersection-sensitive algorithm for snap rounding
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
Mark de Berg, Dan Halperin, Mark H. Overmars
JFP
2008
85views more  JFP 2008»
15 years 6 months ago
Applicative programming with effects
In this paper, we introduce Applicative functors--an abstract characterisation of an applicative style of effectful programming, weaker than Monads and hence more widespread. it i...
Conor McBride, Ross Paterson