This paper investigates the decentralized detection of Hidden Markov Processes using the NeymanPearson test. We consider a network formed by a large number of distributed sensors....
Joffrey Villard, Pascal Bianchi, Eric Moulines, Pa...
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...