In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...