Jérémy Barbay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jérémy Barbay has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Carlos Ochoa
Universidad de Chile
4 shared publications - Javiel Rojas-Ledesma
Department of Computer Science University of Chile Beauchef 851 Santiago Chile
4 shared publications J. Ian Munro
University of Waterloo, Canada
3 shared publications- Pablo Pérez-Lantero
Facultad de Ciencia, Departamento de Matemática y Ciencia de la Computación, Universidad de Santiago de Chile (USACH), Santiago, Chile
3 shared publications - Srinivasa Rao Satti
Norwegian Univ Sci & Technol, Trondheim, Norway
3 shared publications Alexander Golynski
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada
2 shared publications
Latest Publications
- Open Access
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Popping Up Balloons for Science: a Research Proposal
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessPopping Up Balloons for Science: a Research Proposal
- Open Access
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-7
A Loggable Aid to Speech: A Research Proposal
Validating that non human animals can communicate with humans using Augmentative and Alternative Communication (AAC) requires extensive logging, and traditional techniques are costly in resources and time. We propose to implement 1) a configurable “communication board” application aimed at small non human animals able to use touch interfaces, which not only emits human words associated to each button, but also logs such interactions; 2) a hardware keyboard to extend the use of such an application to larger non human animals unable to use a touch screen, but able to use large keys and 3) a centralized back-end gathering the logs from various devices, facilitating their study by researchers. We propose to validate the usability of such prototype solutions with two monk parakeets parrots for the application, a dog and two cats for the keyboard (and application), and a researcher in comparative psychology for the website of the back-end.
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessA Loggable Aid to Speech: A Research Proposal
Validating that non human animals can communicate with humans using Augmentative and Alternative Communication (AAC) requires extensive logging, and traditional techniques are costly in resources and time. We propose to implement 1) a configurable “communication board” application aimed at small non human animals able to use touch interfaces, which not only emits human words associated to each button, but also logs such interactions; 2) a hardware keyboard to extend the use of such an application to larger non human animals unable to use a touch screen, but able to use large keys and 3) a centralized back-end gathering the logs from various devices, facilitating their study by researchers. We propose to validate the usability of such prototype solutions with two monk parakeets parrots for the application, a dog and two cats for the keyboard (and application), and a researcher in comparative psychology for the website of the back-end.
- Open Access
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessMeasuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application
- Open Access
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Can Monk Parakeets compare quantities faster and/or better than Humans? A Research Proposal
When comparing two sets of objects, one can compare their cardinalities, or map one set to the other. Which of the two comparison methods an individual (human or not) is using depends of the cardinalities compared and of whether the representation is well known or not. While the discrimination ability is well documented for various species, less information is available on their discrimination mode. How can one measure the discrimination ability and mode of individuals? We propose to design, implement and test a Digital Life Enrichment application requesting subjects to select the maximum of a set of values while measuring the answering time of the subject; and to decide the mode of comparison used by comparing how those answering time vary with the numeric representations (symbolic or random).
- 5 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessCan Monk Parakeets compare quantities faster and/or better than Humans? A Research Proposal
When comparing two sets of objects, one can compare their cardinalities, or map one set to the other. Which of the two comparison methods an individual (human or not) is using depends of the cardinalities compared and of whether the representation is well known or not. While the discrimination ability is well documented for various species, less information is available on their discrimination mode. How can one measure the discrimination ability and mode of individuals? We propose to design, implement and test a Digital Life Enrichment application requesting subjects to select the maximum of a set of values while measuring the answering time of the subject; and to decide the mode of comparison used by comparing how those answering time vary with the numeric representations (symbolic or random).
- 1 September 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 883, 69-82
Computing the depth distribution of a set of boxes
- 1 September 2021
- Published by Elsevier in Theoretical Computer Science
- Vol. 883, 69-82
Computing the depth distribution of a set of boxes
- 1 May 2020
- Published by Elsevier in Theoretical Computer Science
- Vol. 815, 270-288
Computing coverage kernels under restricted settings
- 1 May 2020
- Published by Elsevier in Theoretical Computer Science
- Vol. 815, 270-288
Computing coverage kernels under restricted settings
- Open Access
- 31 December 2019
- Published by MDPI AG in Algorithms
- Vol. 13 (1) , 12
Optimal Prefix Free Codes with Partial Sorting
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within , where the alternation approximates the minimal amount of sorting required by the computation. This asymptotical complexity is within a constant factor of the optimal in the algebraic decision tree computational model, in the worst case over all instances of size n and alternation . Such results refine the state of the art complexity of in the worst case over instances of size n in the same computational model, a landmark in compression and coding since 1952. Beside the new analysis technique, such improvement is obtained by combining a new algorithm, inspired by van Leeuwen’s algorithm to compute optimal prefix free codes from sorted weights (known since 1976), with a relatively minor extension of Karp et al.’s deferred data structure to partially sort a multiset accordingly to the queries performed on it (known since 1988). Preliminary experimental results on text compression by words show to be polynomially smaller than n, which suggests improvements by at most a constant multiplicative factor in the running time for such applications.- 31 December 2019
- Published by MDPI AG in Algorithms
- Vol. 13 (1) , 12
Open AccessOptimal Prefix Free Codes with Partial Sorting
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within , where the alternation approximates the minimal amount of sorting required by the computation. This asymptotical complexity is within a constant factor of the optimal in the algebraic decision tree computational model, in the worst case over all instances of size n and alternation . Such results refine the state of the art complexity of in the worst case over instances of size n in the same computational model, a landmark in compression and coding since 1952. Beside the new analysis technique, such improvement is obtained by combining a new algorithm, inspired by van Leeuwen’s algorithm to compute optimal prefix free codes from sorted weights (known since 1976), with a relatively minor extension of Karp et al.’s deferred data structure to partially sort a multiset accordingly to the queries performed on it (known since 1988). Preliminary experimental results on text compression by words show to be polynomially smaller than n, which suggests improvements by at most a constant multiplicative factor in the running time for such applications. - 14 September 2018
- Published by Springer Nature
- p. 61-73
Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation
- 14 September 2018
- Published by Springer Nature
- p. 61-73
Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation
- 14 September 2018
- Published by Springer Nature
- p. 50-60
Adaptive Computation of the Discrete Fréchet Distance
- 14 September 2018
- Published by Springer Nature
- p. 50-60
Adaptive Computation of the Discrete Fréchet Distance
- 29 June 2018
- Published by Springer Nature
- p. 180-191
Computing Coverage Kernels Under Restricted Settings
- 29 June 2018
- Published by Springer Nature
- p. 180-191
Computing Coverage Kernels Under Restricted Settings