725 search results - page 79 / 145 » Descriptive Set Theory of Families of Small Sets |
157
click to vote
FSE
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
OTM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we present and discuss a meta-ontological archifor ontologies which centers on abstract core ontologies (ACOs). s the most abstract part of a foundational o...