11397 search results - page 284 / 2280 » A Relational Abstraction for Functions |
178
click to vote
IFIP
2004
Springer
16 years 22 days ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
171
click to vote
MM
2003
ACM
16 years 19 days ago
2003
ACM
In this paper, we propose a novel solution for segmenting an instructional video into hierarchical topical sections. Incorporating the knowledge of education-oriented film theory...
190
click to vote
WOLLIC
2010
Springer
16 years 13 days ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
174
click to vote
ERSHOV
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Monads are a technique widely used in functional programming languages to address many different problems. This paper presents extensions, a functional-logic programming...
176
click to vote
CRYPTO
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Since Crypto 2004, hash functions have been the target of many attacks which showed that several well-known functions such as SHA-0 or MD5 can no longer be considered sec...