From 640e95e9514c871c686b624ece9f822f1828cfa4 Mon Sep 17 00:00:00 2001
From: Theo Guyard <theo.guyard@insa-rennes.fr>
Date: Mon, 6 Jun 2022 09:53:12 +0200
Subject: [PATCH] Update README
---
README.md | 15 ++++++++-------
1 file changed, 8 insertions(+), 7 deletions(-)
diff --git a/README.md b/README.md
index 8374628..5233a3c 100644
--- a/README.md
+++ b/README.md
@@ -1,8 +1,8 @@
-# Branch-screening tests for the L0-penalized least-square problem
+# Node-screening tests for the L0-penalized least-square problem
This repository contains numerical procedures linked to the paper
-> Théo Guyard, Cédric Herzet, Clément Elvira, *Node-screening tests for L0-penalized least-squares problem with supplementary material*
+> Guyard, T., Herzet, C., & Elvira, C. (2022, May). Node-Screening Tests For The L0-Penalized Least-Squares Problem. In *ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)* (pp. 5448-5452). IEEE.
available [here](https://arxiv.org/pdf/2110.07308.pdf). If you encounter a bug or something unexpected, please let me know by raising an issue on the project page or by contacting me by [mail](mailto:theo.guyard@insa-rennes.fr).
@@ -71,11 +71,12 @@ This software is distributed under the [MIT Licence](https://mit-license.org).
If you use this package for your own work, please consider citing it as :
```bibtex
-@article{guyard2021node,
- title={Node-screening tests for L0-penalized least-squares problem with supplementary material},
+@inproceedings{guyard2022node,
+ title={Node-Screening Tests For The L0-Penalized Least-Squares Problem},
author={Guyard, Th{\'e}o and Herzet, C{\'e}dric and Elvira, Cl{\'e}ment},
- journal={arXiv preprint arXiv:2110.07308},
- year={2021}
+ booktitle={ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
+ pages={5448--5452},
+ year={2022},
+ organization={IEEE}
}
-
```
--
GitLab