![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Justine Bonnot
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Quentin Milot
, Mickaël Dardaillon
, Justine Bonnot
, Daniel Ménard
:
Wordlength Optimization for Custom Floating-Point Systems. DASIP 2024: 43-55 - 2022
- [c11]Nicolas Sourbier, Justine Bonnot, Frédéric Majorczyk, Olivier Gesny
, Thomas Guyet
, Maxime Pelcat:
Imbalanced classification with tpg genetic programming: impact of problem imbalance and selection mechanisms. GECCO Companion 2022: 608-611 - 2020
- [c10]Justine Bonnot, Daniel Ménard, Karol Desnos:
Fast Kriging-based Error Evaluation for Approximate Computing Systems. DATE 2020: 1384-1389 - [c9]Mathieu Percelay, Justine Bonnot, Florian Arrestier, Daniel Ménard:
Polynomial Approximation with Non-Uniform Segmentation for Bivariate Functions. SiPS 2020: 1-6
2010 – 2019
- 2019
- [c8]Justine Bonnot, Karol Desnos, Daniel Ménard:
Accuracy Evaluation Based on Simulation for Finite Precision Systems Using Inferential Statistics. ICASSP 2019: 1508-1512 - 2018
- [c7]Justine Bonnot, Vincent Camus, Karol Desnos, Daniel Ménard:
Cassis: Characterization with Adaptive Sample- Size Inferential Statistics Applied to Inexact Circuits. EUSIPCO 2018: 677-681 - [c6]Justine Bonnot, Karol Desnos, Maxime Pelcat, Daniel Ménard:
A Fast and Fuzzy Functional Simulator of Inexact Arithmetic Operators for Approximate Computing Systems. ACM Great Lakes Symposium on VLSI 2018: 195-200 - [c5]Justine Bonnot, Karol Desnos, Daniel Ménard:
Stochastic Modeling to Accelerate Approximate Operators Simulation. ISCAS 2018: 1-5 - [c4]Justine Bonnot, Karol Desnos, Daniel Ménard:
Algorithm-level approximation for fast (or not) embedded stereovision algorithm. SAMOS 2018: 139-145 - 2017
- [j1]Alexandre Mercat, Justine Bonnot, Maxime Pelcat, Karol Desnos, Wassim Hamidouche, Daniel Ménard:
Smart search space reduction for approximate computing: A low energy HEVC encoder case study. J. Syst. Archit. 80: 56-67 (2017) - [c3]Alexandre Mercat, Justine Bonnot, Maxime Pelcat, Wassim Hamidouche, Daniel Ménard:
Exploiting computation skip to reduce energy consumption by approximate computing, an HEVC encoder case study. DATE 2017: 494-499 - 2016
- [c2]Justine Bonnot, Erwan Nogues, Daniel Ménard:
New non-uniform segmentation technique for software function evaluation. ASAP 2016: 131-138 - [c1]Justine Bonnot, Erwan Nogues, Daniel Ménard:
New evaluation scheme for software function approximation with non-uniform segmentation. EUSIPCO 2016: 632-636
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint