Sciweavers

3690 search results - page 238 / 738
» Computation with classical sequents
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
15 years 25 days ago
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)
ly abstract model for a quantum unctional language (extended abstract) Peter Selinger1 ,2 Dalhousie University, Halifax, Nova Scotia, Canada Beno^it Valiron3 University of Ottawa, ...
Peter Selinger, Benoît Valiron
FUIN
2008
107views more  FUIN 2008»
15 years 25 days ago
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
Kimmo Varpaaniemi, Leo Ojala
116
Voted
ECEASST
2006
72views more  ECEASST 2006»
15 years 24 days ago
ENFORCe: A System for Ensuring Formal Correctness of High-level Programs
Graph programs allow a visual description of programs on graphs and graph-like structures. The correctness of a graph program with respect to a pre- and a postcondition can be show...
Karl Azab, Annegret Habel, Karl-Heinz Pennemann, C...
77
Voted
IJON
2006
71views more  IJON 2006»
15 years 23 days ago
Maximization of statistical moments for blind separation of sources revisited
In this paper we revisit a classic HOS-based BSS criterion, namely the maximization of the higher-order moments of the estimated sources. The main contributions of this paper are:...
Susana Hornillo-Mellado, Rubén Martí...
94
Voted
IJON
2007
118views more  IJON 2007»
15 years 21 days ago
CATS benchmark time series prediction by Kalman smoother with cross-validated noise density
This article presents the winning solution to the CATS time series prediction competition. The solution is based on classical optimal linear estimation theory. The proposed method...
Simo Särkkä, Aki Vehtari, Jouko Lampinen