1 citations · 2 across the 10 of their papers we have counts for
15 papers
Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots
Jérémy Barbay
Computerized Adaptive Testing (CAT) measures an examinee's ability while adapting to their level. Both too many questions and too many hard questions can make a test frustrating. A…
Measuring Discrimination Abilities of Monk Parakeets Between Discreet and Continuous Quantities Through a Digital Life Enrichment Application
Jérémy Barbay, Fabián Jaña, Cristóbal Sepulveda Álvarez
Ain et al. measured three African Grey (Psittacus erithacus) parrot's discrimination abilities between discreet and continuous quantities. Some features of their experimental proto…
The Computational Complexity of Evil Hangman
Jérémy Barbay, Bernardo Subercaseaux
The game of Hangman is a classical asymmetric two player game in which one player, the setter, chooses a secret word from a language, that the other player, the guesser, tries to d…
Indexed Dynamic Programming to boost Edit Distance and LCSS Computation
Jérémy Barbay, Andrés Olivares
There are efficient dynamic programming solutions to the computation of the Edit Distance from to , for many natural subsets of edit operations, typica…
Adaptive Computation of the Discrete Fréchet Distance
Jérémy Barbay
The discrete Fr{é}chet distance is a measure of similarity between point sequences which permits to abstract differences of resolution between the two curves, approximating the ori…
Computing Coverage Kernels Under Restricted Settings
Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
We consider the Minimum Coverage Kernel problem: given a set of -dimensional boxes, find a subset of of minimum size covering the same region as . This problem is $\m…