19 search results - page 4 / 4 » On Efficient Numerical Approximation of the Bilinear Form c*... |
ICA
2010
Springer
13 years 6 months ago
2010
Springer
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
IJRR
2007
13 years 5 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
CAD
2005
Springer
13 years 5 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
SIAMMAX
2010
12 years 12 months ago
2010
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...