A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Io...
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Abstract. We study various ensemble methods for hybrid neural networks. The hybrid networks are composed of radial and projection units and are trained using a deterministic algori...
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
Andrew K. Bolstad, Barry D. Van Veen, Robert D. No...