Zobrazeno 1 - 10
of 168
pro vyhledávání: '"Chavez, Edgar"'
Let $S_1, S_2 \in \Sigma^*$ strings, we say that $S_1$ {\em jumble match} $S_2$ if they are permutations of each other. Given a text $T$ of size $N$ and a string $S \in \Sigma^*$, the problem of \emph{Jumbled Pattern Matching} (JPM) is to determine a
Externí odkaz:
http://arxiv.org/abs/2203.00164
Publikováno v:
In Information Systems March 2024 121
Autor:
Antezana-Chavez, Edgar, Papantoniou, Alonso, Waisten, Karen, Rodriguez, Gabriela, Hadid, Claudio, Di Toro, Dario, Celano, Leonardo, Lopez, Carlos, Labadet, Carlos, Gagliardi, Juan
Publikováno v:
In Journal of Electrocardiology January-February 2024 82:141-146
Autor:
Talamantes, Ariana, Chavez, Edgar
The primary example of instance-based learning is the $k$-nearest neighbor rule (kNN), praised for its simplicity and the capacity to adapt to new unseen data and toss away old data. The main disadvantages often mentioned are the classification compl
Externí odkaz:
http://arxiv.org/abs/2102.02755
Autor:
Troche-Souza, Carlos H., Velázquez-Salazar, Samuel, Cruz-López, María Isabel, Rodríguez-Zúñiga, María Teresa, Alcántara-Maya, José Alberto, Vázquez-Balderas, Berenice, Valderrama-Landeros, Luis, Villeda-Chávez, Edgar, Ressl, Rainer
Publikováno v:
In Land Use Policy November 2023 134
Publikováno v:
In Indian Pacing and Electrophysiology Journal September-October 2023 23(5):151-154
Autor:
Geiß, Manuela, Chavez, Edgar, Gonzalez, Marcos, Lopez, Alitzel, Stadler, Bärbel M. R., Valdivia, Dulce I., Hellmuth, Marc, Rosales, Maribel H., Stadler, Peter F.
THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $\sigma$ an assignment of leave
Externí odkaz:
http://arxiv.org/abs/1803.10989
Autor:
Talamantes, Ariana, Chavez, Edgar
Publikováno v:
In Pattern Recognition Letters April 2022 156:88-95
Publikováno v:
Pattern Analysis and Applications 24 763--777 2021
Near neighbor search (NNS) is a powerful abstraction for data access; however, data indexing is troublesome even for approximate indexes. For intrinsically high-dimensional data, high-quality fast searches demand either indexes with impractically lar
Externí odkaz:
http://arxiv.org/abs/1705.10351
Publikováno v:
Multimedia Tools & Applications; Jul2024, Vol. 83 Issue 24, p65039-65058, 20p