Working with ever-increasing datasets might take a lot of time and resources. De Bruijn sequences, which allow you to visit all possible combinations of data precisely once, might be an appealing option for attempting to handle the linked items inside such datasets in the most efficient manner possible. The same method may be expanded to incorporate more dimensions, such as de Bruijn tori for bidimensional patterns or de Bruijn 3D-hypertori for tridimensional patterns, which can be further developed to infinite dimensions. The goals of this research are to reveal the key characteristics of all de Bruijn forms, as well as certain pertinent specific examples, that may be beneficial in pattern location in one, two, and three dimensions. De Bruijn sequences have been extended to higher dimensions, resulting in de Bruijn hypertori, and a generic template for the most frequent requirement for achieving such forms has been presented.
Pedro J. Roig,
Miguel Hernandez University, Elche, Spain and University of the Balearic Islands, Spain.
Salvador Alcaraz,
Miguel Hernandez University, Elche, Spain.
Katja Gilly,
Miguel Hernandez University, Elche, Spain.
Cristina Bernad,
Miguel Hernandez University, Elche, Spain.
Carlos Juiz,
University of the Balearic Islands, Spain.
Please see the link here: https://stm.bookpi.org/NTPSR-V4/article/view/6930
No comments:
Post a Comment