Results 121 to 130 of about 1,541,664 (157)

LEXF-ATT-XLM: A hybrid lexicon-enhanced attention model for hate speech detection in low-resource language Roman Urdu. [PDF]

PLoS One
Awan JJ, Hamid M, Alshalali TAN.
europepmc   +1 more source

Personalized gene expression prediction in the era of deep learning: a review. [PDF]

Brief Bioinform
Dubey V, Shen L.
europepmc   +1 more source

The Rise of Small Language Models in Healthcare: A Comprehensive Survey. [PDF]

Comput Sci Rev
Garg M, Raza S, Rayana S, Liu X, Sohn S.
europepmc   +1 more source

Optimizing SMILES token sequences via trie-based refinement and transition graph filtering. [PDF]

J Cheminform
Radhakrishnan S, Mody K, Venkatesh A, Venkatesh A.   +3 more
europepmc   +1 more source

MentalRoBERTa-Caps: A capsule-enhanced transformer model for mental health classification. [PDF]

MethodsX
Wagay FA, Jahiruddin, Altaf Y.
europepmc   +1 more source

Comparative evaluation of domain-specific and general-purpose transformer models for Arabic poet classification. [PDF]

Sci Rep
Alnefaie S.
europepmc   +1 more source

Decoding promoter activity from DNA sequence using pre-trained language models. [PDF]

Sci Rep
Jung C.
europepmc   +1 more source

Subword complexity and power avoidance [PDF]

Theoretical Computer Science, 2019
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that -- the Thue-Morse word has the minimum possible subword complexity over all overlap-free binary words and all $(\frac 73)$-power-free binary words, but not over all $(\frac 73)^+$-power-free binary words;
Jeffrey Shallit
exaly   +8 more sources

Subword complexity and projection bodies [PDF]

Advances in Mathematics, 2008
The Hartman sequence \((h(P, \alpha)_k)_{k\in\mathbb{Z}}\) induced by a polytope \(P \subseteq [0, 1)^d\) and an \(\alpha \in [0, 1)^d\) is defined by \(h(P, \alpha)_k = 1\) if \(k \alpha \in P + \mathbb{Z}^d\) and \(h(P, \alpha)_k = 0\) else. The factor complexity (or subword complexity) \(p_{P,\alpha}(N)\) of this sequence is the number of different ...
Steineder, Christian
exaly   +4 more sources

The subword complexity of a class of infinite binary words [PDF]

Advances in Applied Mathematics, 2007
29 pages, 2 ...
Gheorghiciuc, Irina
exaly   +4 more sources