We present experiments with a dependency parsing model defined on rich factors. Our model represents dependency trees with factors that include three types of relations between t...
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
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...
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...