Sciweavers

719 search results - page 77 / 144
» Solving Sparse Linear Constraints
Sort
View
IWANN
2001
Springer
15 years 3 months ago
The Minimum Entropy and Cumulants Based Contrast Functions for Blind Source Extraction
Abstract. In this paper we address the problem of blind source extraction of a subset of “interesting” independent sources from a linear convolutive or instantaneous mixture. T...
Sergio Cruces, Andrzej Cichocki, Shun-ichi Amari
83
Voted
COCOON
2000
Springer
15 years 3 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
IFIP
2000
Springer
15 years 2 months ago
PETSc and Overture: Lessons Learned Developing an Interface between Components
We consider two software packages that interact with each other as components: Overture and PETSc. An interface between these two packages could be of tremendous value to applicati...
Kristopher R. Buschelman, William Gropp, Lois C. M...
IPPS
1995
IEEE
15 years 2 months ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha
116
Voted
NIPS
2004
15 years 9 days ago
Computing regularization paths for learning multiple kernels
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
Francis R. Bach, Romain Thibaux, Michael I. Jordan