Expertini Research Research

Browse Research Papers

19,482+ open-access research outputs.

โœ• Clear
๐Ÿ” theoretical ๐Ÿ“‚ Computer Science
Showing 19482 results for "theoretical" in Computer Science
Computer Science Preprint PDF DOI

Optimal Transmitter Placement in Realistic Urban Environments

Lukas Taus, Richard Tsai, Jeffrey G. Andrews ยท 2026

In a wireless network, the spatial location of the transmitters has a large impact on the achievable rate at each user location. The optimal placement of -- for example -- cellular base stations is a โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Enhancing multimodal affect recognition in healthcare: the robustness of appraisal dimensions over labels within age groups and in cross-age generalisation

Hippolyte Fournier, Sina Alisamir, Safaa Azzakhnini, Isabella Zsoldos, Eleonore Tran, Gerard Bailly, Frederic Elisei, Beatrice Bouchot, Brice Varini, Patrick Constant, Joan Fruitet, Franck Tarpin-Bernard, Solange Rossato, Francois Portet, Olivier Koenig, Hanna Chainay, Fabien Ringeval ยท 2026

The integration of artificial intelligence (AI) into healthcare has advanced significantly, yet affect recognition remains a major challenge, particularly in AI-assisted interventions such as Computerโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results

Aida Abiad, Antonina P. Khramova, Sven C. Polak, Ferdinando Zullo ยท 2026

The sum-rank metric provides a unifying framework that generalizes both the celebrated Hamming and rank metrics, and has found applications in areas such as network coding, distributed storage, and spโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Can We Volunteer Out of the Peer Review Crisis?

Theo Tang, Toby Handfield, Julian Garcia ยท 2026

The volume of scientific manuscripts is growing faster than the capacity to evaluate them, yet the institutions that govern peer review have remained largely unchanged. The result is a widening mismatโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

ZipCCL: Efficient Lossless Data Compression of Communication Collectives for Accelerating LLM Training

Wenxiang Lin, Xinglin Pan, Ruibo Fan, Shaohuai Shi, Xiaowen Chu ยท 2026

Communication has emerged as a critical bottleneck in the distributed training of large language models (LLMs). While numerous approaches have been proposed to reduce communication overhead, the potenโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Why Self-Supervised Encoders Want to Be Normal

Yuval Domb ยท 2026

We develop a geometric and information-theoretic framework for encoder-decoder learning built on the Information Bottleneck (IB) principle. Recasting IB as a rate-distortion problem with Kullback-Leibโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Exploring the Adoption Intention in Using AI-Enabled Educational Tools Among Preservice Teachers in the Philippines: A Partial-Least Square Modeling

Vanessa B. Sibug, Emerson Q. Fernando, Almer B. Gamboa, Roque Francis B. Dianelo, Agnes R. Regala, Joseph Alexander Bansil, Jan Henry B. Sunga, Vernon Grace M. Maniago, John Paul P. Miranda ยท 2026

This study examines the factors influencing pre-service teachers' behavioral intention to use AI-enabled educational tools during their practicum, using the Unified Theory of Acceptance and Use of Tecโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Diagrammatic Axiomatisation of Behavioural Distance of Nondeterministic Processes

Wojciech Rozowski, Robin Piedeleu, Alexandra Silva, Fabio Zanasi ยท 2026

Behavioural distances provide a quantitative approach to comparing the states of transition systems, moving beyond traditional Boolean notions of equivalence. In this paper, we develop a sound and comโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Discipline-Agnostic AI Literacy Course for Academic Research: Architecture, Pedagogy, and Implementation

Gideon K. Gogovi ยท 2026

The rapid integration of generative AI into academic workflows demands curricula that equip students not only with tool proficiency but with the critical judgment to use those tools responsibly in schโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Graphify: Automated Synthesis of Type-Safe Graph Backends via $O(S)$ GraphQL-to-Gremlin Transpilation

Johannes Graf ยท 2026

Graph databases offer unparalleled flexibility for managing interconnected data, yet the lack of strict schema enforcement often leads to runtime uncertainties and complex query development. This papeโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Input Distribution Design for Ranging-Oriented OFDM-ISAC Systems Under Frequency-Selective Fading

Weijiang Zhao, Yifeng Xiong ยท 2026

The implementation of the \ac{isac} feature in \ac{6g} networks is most likely to be based on the framework of \ac{ofdm}. Input distribution design, or constellation design, is a crucial technique in โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)

Benedikt Bollig ยท 2026

Runtime verification is a lightweight verification technique that complements model checking by analyzing system executions at runtime rather than exploring a complete system model in advance. It is pโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Existence and Constructions of Strict Function-Correcting Codes with Data Protection

Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti, Camilla Hollanti ยท 2026

Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives strictly stronger protectโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Multi-Server Secure Aggregation with Arbitrary Collusion and Heterogeneous Security Constraints

Zhou Li, Xiang Zhang, Jiguang He, Giuseppe Caire ยท 2026

We study the fundamental limits of multi-server secure aggregation over a two-hop network where multiple servers, each connected to a disjoint subset of users, jointly compute the sum of all users' inโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Automaton-based Characterisations of First Order Logic over Infinite Trees

Massimo Benerecetti, Dario Della Monica, Angelo Matteo, Fabio Mogavero, Gabriele Puppis ยท 2026

We study the expressive power of First-Order Logic (\FO) over (unordered) infinite trees, with the aim of identifying robust characterisations in terms of branching-time specification formalisms. Whilโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

PiLLar: Matching for Pivot Table Schema via LLM-guided Monte-Carlo Tree Search

Yunjun Gao, Chuangyu Ouyang, Congcong Ge, Yifan Zhu ยท 2026

Pivot tables are ubiquitous in data lakes of modern data ecosystems, making accurate schema matching over pivot tables a key prerequisite for data integration. In this paper, we focus on matching for โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Rethinking Mutual Coupling in Movable Antenna MIMO Systems: Modeling and Optimization

Tianyi Liao, Wei Guo, Jun Qian, Zixin Wang, Shenghui Song, Jun Zhang, Khaled B. Letaief ยท 2026

Movable antennas (MAs) have attracted growing interest for their ability to improve channel conditions via adaptive antenna movement. Nevertheless, such movement inevitably introduces mutual coupling โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Verification of Neural Networks (Lecture Notes)

Benedikt Bollig ยท 2026

These lecture notes provide an introduction to the verification of neural networks from a theoretical perspective. We discuss feed-forward neural networks, recurrent neural networks, attention mechaniโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Decomposition of Automata recognizing Ideals

Mathias Berry, Pierre-Cyrille Heam, Ismael Jecker ยท 2026

Minimizing the size of finite automata is a fundamental problem in theoretical computer science. Beyond standard minimization, further reductions can be achieved by decomposing an automaton into smallโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Job-Scheduling Games with Time-Dependent Processing Times

Ido Borenstein, Tami Tamir ยท 2026

Job-scheduling games have traditionally assumed fixed processing times. However, in many realistic environments, ranging from cyber-security response to high-frequency trading, a task's duration depenโ€ฆ

Read Paper โ†’
Page 1 of 975 Next โ†’