1670 search results - page 186 / 334 » On Skolemization in constructive theories |
159
click to vote
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
169
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
182
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
176
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
166
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...