Sciweavers

12289 search results - page 507 / 2458
» computing 2006
Sort
View
LOGCOM
2010
85views more  LOGCOM 2010»
15 years 5 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...
MST
2010
105views more  MST 2010»
15 years 5 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
PAMI
2010
222views more  PAMI 2010»
15 years 5 months ago
Fast Algorithm for Walsh Hadamard Transform on Sliding Windows
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
Wanli Ouyang, Wai-kuen Cham
RSA
2010
98views more  RSA 2010»
15 years 5 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
FOSSACS
2006
Springer
15 years 10 months ago
Reversing Algebraic Process Calculi
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languag...
Iain C. C. Phillips, Irek Ulidowski