Jean-Baptiste Yunès

According to our database1, Jean-Baptiste Yunès authored at least 35 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Investigating Techniques for a Deeper Understanding of Neural Machine Translation (NMT) Systems through Data Filtering and Fine-tuning Strategies.
Proceedings of the Eighth Conference on Machine Translation, 2023

The MAKE-NMTVIZ System Description for the WMT23 Literary Task.
Proceedings of the Eighth Conference on Machine Translation, 2023

Using Whisper LLM for Automatic Phonetic Diagnosis of L2 Speech, a Case Study with French Learners of English.
Proceedings of the 6th International Conference on Natural Language and Speech Processing (ICNLSP 2023), 2023

2022
The SPECTRANS System Description for the WMT22 Biomedical Task.
Proceedings of the Seventh Conference on Machine Translation, 2022

2021
The SPECTRANS System Description for the WMT21 Terminology Task.
Proceedings of the Sixth Conference on Machine Translation, 2021

2020
Approches quantitatives de l'analyse des pr{é}dictions en traduction automatique neuronale (TAN).
CoRR, 2020

The Learnability of the Annotated Input in NMT Replicating (Vanmassenhove and Way, 2018) with OpenNMT.
Proceedings of The 12th Language Resources and Evaluation Conference, 2020

2018
Generalized FSSP on Two Triangular Tilings.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018

2016
An efficient algorithm for generating symmetric ice piles.
Theor. Comput. Sci., 2016

Finitization of Infinite Field-based Multi-general FSSP Solution.
J. Cell. Autom., 2016

Synchronizing the Squad with (Almost) Arbitrary Cut Ratio.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

A Field Based Solution of Mazoyer's FSSP Schema.
Proceedings of the Cellular Automata, 2016

2014
Automatic image quality assessment in digital pathology: from idea to implementation.
Proceedings of the International Work-Conference on Bioinformatics and Biomedical Engineering, 2014

Advances on Random Sequence Generation by Uniform Cellular Automata.
Proceedings of the Computing with New Resources, 2014

Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

Experimental Finitization of Infinite Field-Based Generalized FSSP Solution.
Proceedings of the Cellular Automata, 2014

2013
Moore and Von Neumann Neighborhood N-Dimensional Generalized Firing Squad Solutions Using Fields.
Proceedings of the First International Symposium on Computing and Networking, 2013

2012
Computations on Cellular Automata.
Proceedings of the Handbook of Natural Computing, 2012

Grids and universal computations on one-dimensional cellular automata.
Nat. Comput., 2012

A Spatio-temporal Algorithmic Point of View on Firing Squad Synchronisation Problem.
Proceedings of the Cellular Automata, 2012

2010
Achieving Universal Computations on One-Dimensional Cellular Automata.
Proceedings of the Cellular Automata, 2010

2009
A Family of Smallest Symmetrical Four-State Firing Squad Synchronization Protocols for Ring Arrays.
Parallel Process. Lett., 2009

Known CA Synchronizers made Insensitive to the Initial State of the Initiato.
J. Cell. Autom., 2009

A Two-Dimensional Optimum-Time Firing Squad Synchronization Algorithm and Its Implementation.
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009

2008
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem.
RAIRO Theor. Informatics Appl., 2008

A 4-states algebraic solution to linear cellular automata synchronization.
Inf. Process. Lett., 2008

Goto's construction and Pascal's triangle: new insights into cellular automata synchronization.
Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

A family of smallest symmetrical four-state firing squad synchronization protocols for one-dimensional ring cellular automata.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

About 4-States Solutions to the Firing Squad Synchronization Problem.
Proceedings of the Cellular Automata, 2008

2007
Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4<i>n</i>-Steps Solution.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Automates Cellulaires; Fonctions Booléennes. (Cellular Automata; Boolean Functions).
, 2007

2006
Fault Tolerant Solutions to the Firing Squad Synchronization Problem in Linear Cellular Automata.
J. Cell. Autom., 2006

2005
On maximal QROBDD's of Boolean functions.
RAIRO Theor. Informatics Appl., 2005

1994
Seven-State Solutions to the Firing Squad Synchronization Problem.
Theor. Comput. Sci., 1994

1993
Synchronisation et Automates Cellulaires: La Ligne de Fusiliers.
PhD thesis, 1993


  Loading...