Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
Christoph Bosshard, Roland Bouffanais, Christian C...
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...
Second-order priors on the smoothness of 3D surfaces are a better model of typical scenes than first-order priors. However, stereo reconstruction using global inference algorithm...
Oliver J. Woodford, Philip H. S. Torr, Ian D. Reid...
Order-preserving submatrices (OPSM’s) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their ab...