Filters
Show more
Show more
Show more
Show more
Show more
Show more
Show more
Show more
More filters
Results
Optimal Detection in Case of the Sparse Training Data
Optimal Detection in Case of the Sparse Training Data...
AI - Jazykověda
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Informational Efficiency of Sparsely Encoded Hopfield-Like Associative Memory.
of the network performance. There exists an optimal sparseness for which the gain is maximal. The optimal sparseness happened to correspond to brain neural activity.A sparsely encoded Hopfield-like attrac...
BB - Aplikovaná statistika, operační výzkum
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Algorithm for Elimination of Systems with Sparse Asymmetric Reducible Matrices.
In the paper, an algorithm for finding an optimal or almost optimal permutation for an ordering of elements of a matrix, which is sparse, asymmetric and reducible, is suggested. Using this algorithm we can solve large s...
BA - Obecná matematika
- 2012 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Sparse Versions of Optimized Centroids
the computational demands of applying the optimal centroid, several novel sparse versions of the optimal centroids are proposed here, which are based on trimming away some optimal centroids. At the same time, some...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2022 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Primal Interior-Point Method for Large Sparse Minimax Optimization
In this paper, we propose a primal interior-point method for large sparse minimax optimization. After a short introduction, the complete algorithm is introduced convergent under standard mild assumptions. Thus the large sparse
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Algorithm 896: LSA: Algorithms for Large-Scale Optimization
constrained optimization and large-scale systems of nonlinear equations. Subroutines, based on various strategies, are intended for dense and sparse general optimization problems, smooth and nonsmooth partially separable <...
BB - Aplikovaná statistika, operační výzkum
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Informational Efficiency of Sparsely Encoded Hopfield-Like Autoassociative Memory
. There exists an optimal sparseness for which the gain is maximal. The optimal sparsenessA sparsely encoded Hopfield-like attractor neural network is investigated). It is shown that the size of attraction...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Informational Efficiency of Sparsely Encoded Hopfield-Like Autoassociative Memory
. There exists an optimal sparseness for which the gain is maximal. The optimal sparsenessA sparsely encoded Hopfield-like attractor neural network is investigated). It is shown that the size of attraction...
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On the Limitation of Convex Optimization for Sparse Signal Segmentation
We show that convex optimization methods have fundamental properties that complicate performing signal segmentation based on sparsity assumptions. We review the recently introduced overcomplete sparse segmentation model, we perform ...
Electrical and electronic engineering
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
THE ENERGY CONSUMPTION OPTIMIZATION OF THE BLAS ROUTINES
The paper deals with the energy consumption evaluation of selected Sparse and Dense BLAS Level 1, 2 and 3 routines. We have employed AXPY, Sparse Matrix-Vector, Sparse Matrix-Matrix, Dense Matrix-Vector, Dense Matrix-Matrix...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2017 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 52 367