default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Bernard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Jean-Marie Guihal
, François Auger, Nicolas Bernard, Emmanuel Schaeffer:
Efficient Implementation of Continuous-Discrete Extended Kalman Filters for State and Parameter Estimation of Nonlinear Dynamic Systems. IEEE Trans. Ind. Informatics 18(5): 3077-3085 (2022)- 2021
- [j5]Raluca Chitic, Franck Leprévost, Nicolas Bernard:
Evolutionary algorithms deceive humans and machines at image classification: an extended proof of concept on two scenarios. J. Inf. Telecommun. 5(1): 121-143 (2021) - [c6]Jean-Marie Guihal, François Auger, Nicolas Bernard, Emmanuel Schaeffer:
A New Diagonally Implicit Implementation of the Continuous-Discrete Extended Kalman Filters for State and Parameter Estimation of Nonlinear Dynamic Systems. IECON 2021: 1-8 - [c5]Raluca Chitic, Nathan Deridder, Franck Leprévost, Nicolas Bernard:
Robustness of Adversarial Images Against Filters. OLA 2021: 101-114 - 2020
- [c4]Raluca Chitic, Nicolas Bernard, Franck Leprévost:
A Proof of Concept to Deceive Humans and Machines at Image Classification with Evolutionary Algorithms. ACIIDS (2) 2020: 467-480 - [c3]Jean-Marie Guihal, François Auger, Emmanuel Schaeffer, Nicolas Bernard:
Parameter Estimation With Continuous-Discrete Extended Kalman Filters Using Implicit Integration Methods. ISIE 2020: 172-178
2010 – 2019
- 2019
- [j4]S. Hmam, Jean-Christophe Olivier, Salvy Bourguet, Luc Loron, Nicolas Bernard, Emmanuel Schaeffer:
A cycle-based formulation for the simulation of multi time-scale systems - Application to the modeling of the storage system of a fully electric ferry. Math. Comput. Simul. 158: 403-417 (2019) - 2018
- [c2]Nicolas Bernard, Franck Leprévost:
Evolutionary Algorithms for Convolutional Neural Network Visualisation. CARLA 2018: 18-32 - 2017
- [j3]Linh Dang, Nicolas Bernard, Nicolas Bracikowski, Gérard Berthiau:
Design Optimization with Flux Weakening of High-Speed PMSM for Electrical Vehicle Considering the Driving Cycle. IEEE Trans. Ind. Electron. 64(12): 9834-9843 (2017) - 2012
- [j2]Nicolas Bernard, Franck Leprévost:
Hardened Bloom Filters, with an Application to Unobservability. Ann. UMCS Informatica 12(4): 11-22 (2012) - 2011
- [c1]Nicolas Bernard, Franck Leprévost:
Beyond TOR: The TrueNyms Protocol. SIIS 2011: 68-84
2000 – 2009
- 2009
- [j1]Nicolas Bernard, Franck Leprévost, Michael Pohst:
Jacobians of Genus-2 Curves with a Rational Point of Order 11. Exp. Math. 18(1): 65-70 (2009) - 2008
- [b1]Nicolas Bernard:
Non-observabilité des communications à faible latence. (Unobservability of low-latency communications). Joseph Fourier University, Grenoble, France, 2008
Coauthor Index
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-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
