6943 search results - page 355 / 1389 » Representations for evolutionary algorithms |
158
Voted
LISP
2008
15 years 6 months ago
2008
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
173
click to vote
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
15 years 6 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
166
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner ...
197
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictiona...
194
click to vote
PAMI
2002
15 years 5 months ago
2002
Decomposing video frames into coherent two-dimensional motion layers is a powerful method for representing videos. Such a representation provides an intermediate description that e...