We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
In this paper, we consider the Lagrangian dual problem of a class of convex optimization problems. We first discuss the semismoothness of the Lagrangian-dual function . This prope...
Fanwen Meng, Gongyun Zhao, Mark Goh, Robert de Sou...
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...