Sciweavers

265 search results - page 33 / 53
» Properties and computations of matrix pseudospectra
Sort
View
NIPS
2007
14 years 11 months ago
A Spectral Regularization Framework for Multi-Task Structure Learning
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
SIAMJO
2000
105views more  SIAMJO 2000»
14 years 9 months ago
On the Identification of Zero Variables in an Interior-Point Framework
Abstract. We consider column sufficient linear complementarity problems and study the problem of identifying those variables that are zero at a solution. To this end we propose a n...
Francisco Facchinei, Andreas Fischer, Christian Ka...
SIAMNUM
2011
139views more  SIAMNUM 2011»
14 years 5 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
SAT
2005
Springer
162views Hardware» more  SAT 2005»
15 years 3 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
MOC
1998
107views more  MOC 1998»
14 years 9 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche