We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
We present a variation of the index calculus attack by Gaudry which can be used to solve the discrete logarithm problem in the Jacobian of hyperelliptic curves. The new algorithm h...
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...
Ill-posed linear equations are pervasive in computer vision. A popular way to solve an ill-posed problem is regularization. In this paper, we propose a new criterion for designing ...
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...