Sciweavers

561 search results - page 48 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
APPROX
2005
Springer
88views Algorithms» more  APPROX 2005»
14 years 1 months ago
Approximating the Best-Fit Tree Under Lp Norms
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
Boulos Harb, Sampath Kannan, Andrew McGregor
NPL
1998
87views more  NPL 1998»
13 years 7 months ago
Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...
Stavros J. Perantonis, Nikolaos Ampazis, Stavros V...
NIPS
2003
13 years 9 months ago
Sparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
Yuanqing Li, Andrzej Cichocki, Shun-ichi Amari, Se...
DEXA
2008
Springer
155views Database» more  DEXA 2008»
13 years 9 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
SIAMSC
2008
123views more  SIAMSC 2008»
13 years 7 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...