We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
The goal of active learning is to determine the locations of training input points so that the generalization error is minimized. We discuss the problem of active learning in line...
Privacy becomes a more and more serious concern in applications involving microdata. Recently, efficient anonymization has attracted much research work. Most of the previous metho...
Jian Xu, Wei Wang 0009, Jian Pei, Xiaoyuan Wang, B...
Our work links Chinese calligraphy to computer science through an integrated intelligence approach. We first extract strokes of existent calligraphy using a semi-automatic, twoph...
Songhua Xu, Hao Jiang, Francis Chi-Moon Lau, Yunhe...