Sciweavers

164 search results - page 9 / 33
» Developing Genetic Algorithms for Boolean Matrix Factorizati...
Sort
View
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
15 years 5 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 5 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
CVPR
2007
IEEE
16 years 1 months ago
Nonnegative Tucker Decomposition
Nonnegative tensor factorization (NTF) is a recent multiway (multilinear) extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are imposed on the C...
Yong-Deok Kim, Seungjin Choi
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 5 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
SIAMMAX
2010
224views more  SIAMMAX 2010»
14 years 6 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu