Différences
Ci-dessous, les différences entre deux révisions de la page.
| Les deux révisions précédentes Révision précédente | Dernière révision Les deux révisions suivantes | ||
|
recherche:projets:faust2020 [2020/04/29 19:29] equemene [Flexible Approximate MUlti-layer Sparse Transforms (FAµST)] |
recherche:projets:faust2020 [2020/04/29 19:30] equemene [Flexible Approximate MUlti-layer Sparse Transforms (FAµST)] |
||
|---|---|---|---|
| Ligne 9: | Ligne 9: | ||
| * speedup / reduce the memory footprint of iterative algorithms commonly used for solving high dimensional linear inverse problems. | * speedup / reduce the memory footprint of iterative algorithms commonly used for solving high dimensional linear inverse problems. | ||
| - | * learn dictionaries with an intrinsically efficient implementation | + | * learn dictionaries with an intrinsically efficient implementation |
| - | * compute (approximate) fast Fourier transforms on graphs. | + | * compute (approximate) fast Fourier transforms on graphs. |
| A C++ implementation (versions 2.x), including Matlab and Python wrappers, is available under an Inria licence. | A C++ implementation (versions 2.x), including Matlab and Python wrappers, is available under an Inria licence. | ||