Sliding window strategy for convolutional spike sorting with Lasso. Algorithm, theoretical guarantees and complexity

From MaRDI portal
Publication:2145675

DOI10.1007/s10440-022-00494-xzbMath1489.90216arXiv2110.15813OpenAlexW4280488859MaRDI QIDQ2145675

Laurent Dragoni, Patricia Reynaud-Bouret, Karim Lounici, Rémi Flamary

Publication date: 17 June 2022

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.15813





Uses Software


Cites Work


This page was built for publication: Sliding window strategy for convolutional spike sorting with Lasso. Algorithm, theoretical guarantees and complexity