Sciweavers

3113 search results - page 403 / 623
» Numerical Methods
Sort
View
SIAMMAX
2011
157views more  SIAMMAX 2011»
14 years 9 months ago
Deflated Restarting for Matrix Functions
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...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
JMLR
2012
13 years 9 months ago
A General Framework for Structured Sparsity via Proximal Optimization
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, ...
JMLR
2006
140views more  JMLR 2006»
15 years 6 months ago
Active Learning in Approximately Linear Regression Based on Conditional Expectation of Generalization Error
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...
Masashi Sugiyama
KDD
2006
ACM
132views Data Mining» more  KDD 2006»
16 years 7 months ago
Utility-based anonymization using local recoding
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...
AAAI
2007
15 years 9 months ago
An Intelligent System for Chinese Calligraphy
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...