Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
Abstract The flux reconstruction approach to high-order methods is robust, efficient, simple to implement, and allows various high-order schemes, such as the nodal discontinuous ...
Peter E. Vincent, Patrice Castonguay, Antony James...
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...
We describe an annotation scheme and a tool developed for creating linguistically annotated corpora for non-configurational languages. Since the requirements for such a formalism ...
Wojciech Skut, Brigitte Krenn, Thorsten Brants, Ha...