1404 search results - page 267 / 281 » Complexity of admissible rules |
184
click to vote
CCS
2005
ACM
15 years 11 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
144
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
182
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
177
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
146
click to vote
ICSR
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes a feature modelling technique aimed at modelling the software assets behind a product family. The proposed technique is distinctive in five respects. First, it...