1018 search results - page 89 / 204 » Generative unbinding of names |
78
Voted
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
We point out that the seemingly strong pseudorandom oracle preserving (PRO-Pr) property of hash function domain-extension transforms defined and implemented by Coron et. al. [12] ...
99
Voted
DSD
2004
IEEE
15 years 4 months ago
2004
IEEE
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
108
click to vote
DIAL
2006
IEEE
15 years 4 months ago
2006
IEEE
We are developing a recognition system, named `Infty', for scientific documents including those with mathematical formulae. In this paper, we propose a new system that can re...
ESWS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Aiming to build a complete benchmark for better evaluation of existing ontology systems, we extend the well-known Lehigh University Benchmark in terms of inference and sc...
101
click to vote
AUSAI
2003
Springer
15 years 4 months ago
2003
Springer
We investigate why discretization is effective in naive-Bayes learning. We prove a theorem that identifies particular conditions under which discretization will result in naiveBay...