Sciweavers

2631 search results - page 8 / 527
» A Practical Method for the Sparse Resultant
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Blind separation of non-negative sources by convex analysis: Effective method using linear programming
We recently reported a criterion for blind separation of non-negative sources, using a new concept called convex analysis for mixtures of non-negative sources (CAMNS). Under some ...
Tsung-Han Chan, Wing-Kin Ma, Chong-Yung Chi, Yue W...
SIAMJO
2008
136views more  SIAMJO 2008»
13 years 7 months ago
Relaxed Alternating Projection Methods
Let A and B be nonempty, convex and closed subsets of a Hilbert space H. In the practical considerations we need to find an element of the intersection A B or, more general, to s...
Andrzej Cegielski, Agnieszka Suchocka
HPDC
2011
IEEE
12 years 11 months ago
Algorithm-based recovery for iterative methods without checkpointing
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
Zizhong Chen
ICML
2006
IEEE
14 years 8 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham
ICML
2007
IEEE
14 years 8 months ago
Sparse eigen methods by D.C. programming
Eigenvalue problems are rampant in machine learning and statistics and appear in the context of classification, dimensionality reduction, etc. In this paper, we consider a cardina...
Bharath K. Sriperumbudur, David A. Torres, Gert R....