Results 1 to 10 of about 114 (95)
Journal of Applied Informatics and ComputingPreserving regional languages is a strategic step in preserving cultural heritage while expanding access to knowledge across generations. One approach that can support this effort is the application of automatic translation technology to digitize and ...
I Gede Bintang Arya Budaya +1 more
doaj +1 more source
Frontiers in GeneticsS-sulfenylation is a critical post-translational modification that plays an important role in regulating protein function, redox signaling, and maintaining cellular homeostasis.
Zihan Zhang, Yixuan Wang
doaj +1 more source
Applied SciencesNatural Language Processing (NLP) is a valuable technology and business topic as it helps turn data into useful information with the spread of digital information.
Israa Mustafa Abbas +4 more
doaj +1 more source
Performance Comparison of Static and Contextual Embedding Models for Opinion Mining
IEEE AccessTransformer-based language models are widely adopted for sentiment analysis due to their strong contextual representation capabilities; however, their high computational complexity can limit practical deployment in resource-constrained environments. This
Dharmendra Dangi +4 more
doaj +1 more source
Infinite words with linear subword complexity
Theoretical Computer Science, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The Evolution of AI: From Classical Machine Learning to Modern Large Language Models
IEEE AccessThis paper provides a comprehensive review of the evolution of artificial intelligence from early symbolic, rule-based systems to modern large language models (LLMs) and retrieval-augmented generation (RAG) architectures.
Rahul Mundlamuri +3 more
doaj +1 more source
Subword Complexes and Kalai’s Conjecture on Reconstruction of Spheres
Discrete & Computational GeometryAbstract A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani (Aequationes Math 34(2–3):287–297, 1987, https://doi.org/10.1007/BF01830678), via a non-constructive proof using topological tools from ...
Cesar Ceballos, Joseph Doolittle
openaire +3 more sources
Subword complexity and projection bodies
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 ...
openaire +2 more sources
ν-Tamari lattices via subword complexes
Electronic Notes in Discrete Mathematics, 2017 Abstract We show that the ν-Tamari lattices of Preville-Ratelle and Viennot can obtained as the duals of certain subword complexes. This generalizes a known result for the classical Tamari lattice, provides a simple description of the lattice property using certain bracket vectors of ν-trees, and gives (conjectural) insight on the geometry of more ...
Cesar Ceballos +2 more
openaire +1 more source
Subword complexes and 2-truncated cubes [PDF]
Russian Mathematical Surveys, 2014 For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these complexes in terms of roots of the corresponding root system.
openaire +2 more sources