2938 search results - page 83 / 588 » On obfuscating point functions |
169
click to vote
TPHOL
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
147
click to vote
ECSQARU
2007
Springer
16 years 14 days ago
2007
Springer
Traditional Dempster Shafer belief theory does not provide a simple method for judging the effect of statistical and probabilistic data on belief functions and vice versa. This put...
171
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
144
click to vote
DBPL
1991
Springer
15 years 9 months ago
1991
Springer
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
162
click to vote
WSC
2007
15 years 8 months ago
2007
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...