Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
We consider the blind separation of sources with general (e.g., not necessarily stationary) temporal covariance structures. When the sources’ temporal covariance matrices are kn...
From an automated planning perspective the problem of practical mobile robot control in realistic environments poses many important and contrary challenges. On the one hand, the p...