Results 61 to 70 of about 649 (143)
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
Engineering Reports, Volume 8, Issue 6, June 2026.This study presents a comprehensive analysis of Bengali AI resources, including NLP tools, machine translation systems, speech technologies, and benchmarking datasets. The findings highlight fragmented development across tasks and emphasize the need for integrated resources, unified benchmarks, and multimodal datasets to build a scalable and robust ...
Fairooz Maliha +5 more
wiley +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
Engineering Reports, Volume 8, Issue 6, June 2026.Flowchart of the proposed process. ABSTRACT This paper explores machine learning‐based discovery of Indian‐origin scientists working overseas with a fused multi‐institution dataset of 4280 records retrieved in seven research institutions: Ames Laboratory, AMNH, Broad Institute, DRI, NIDDK‐NIH, Salk Institute, and Van Andel Institute.
Shivani Gautam +6 more
wiley +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
On Possibilities and Challenges of GPT‐Assisted Learning Environments
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 2, June 2026.ABSTRACT Contemporary education demands a student‐centered and competence‐oriented approach. Learners must tackle and solve problems independently and in line with constructivist learning theories. Accordingly, instructional roles must evolve from mere knowledge transmission to facilitating students' autonomous achievement of learning objectives—a ...
Marius Harnisch, Thorsten Bartel
wiley +1 more source
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 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