We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Open source communities have been of great interest for researchers recently, yet little can be agreed upon when it comes to developers motives. While it has been shown that partic...
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
In this paper, a novel approach for contour-based 2D shape recognition is proposed, using a recently introduced class of information theoretic kernels. This kind of kernels, based...
Manuele Bicego, André Filipe Torres Martins, Vitt...