Expertini Research Research

Browse Research Papers

266+ open-access research outputs.

✕ Clear
🔍 david klein 📂 Computer Science
Showing 266 results for "david klein" in Computer Science
Computer Science Preprint PDF DOI

Analysis of AWW (Anganwadi Workers) Training Content, ILA (Incremental Learning Approach) Modules Following CDT (Component Display Theory)

Arka Majhi, Satish B. Agnihotri · 2026

POSHAN Abhiyan envisages capacity building of AWWs or frontline health workers through 21 training modules of ILA (Incremental Learning Approach), modularising the net learning content into smaller le…

Read Paper →
Computer Science Preprint PDF DOI

AVID: A Benchmark for Omni-Modal Audio-Visual Inconsistency Understanding via Agent-Driven Construction

Zixuan Chen, Depeng Wang, Hao Lin, Li Luo, Ke Xu, Ya Guo, Huijia Zhu, Tanfeng Sun, Xinghao Jiang · 2026

We present AVID, the first large-scale benchmark for audio-visual inconsistency understanding in videos. While omni-modal large language models excel at temporally aligned tasks such as captioning and…

Read Paper →
Computer Science Preprint PDF DOI

A Non-Probabilistic Game-Theoretic Information Theory Which Subsumes Probabilistic Channel Coding

Cheuk Ting Li · 2026

Probabilistic settings (e.g., vanishing-error channel coding) and non-probabilistic settings (e.g., zero-error channel coding and adversarial channels) were considered two related but different branch…

Read Paper →
Computer Science Preprint PDF DOI

The Theorems of Dr. David Blackwell and Their Contributions to Artificial Intelligence

Napoleon Paxton · 2026

Dr. David Blackwell was a mathematician and statistician of the first rank, whose contributions to statistical theory, game theory, and decision theory predated many of the algorithmic breakthroughs t…

Read Paper →
Computer Science Preprint PDF DOI

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs

Sandor Kisfaludi-Bak, Daniel Marx · 2026

We give approximation schemes for Subset TSP and Steiner Tree on unit disk graphs, and more generally, on intersection graphs of similarly sized connected fat (not necessarily convex) polygons in the …

Read Paper →
Computer Science Preprint PDF DOI

Linear time single-source shortest path algorithms in Euclidean graph classes

Joachim Gudmundsson, Yuan Sha, Sampson Wong · 2026

In the celebrated paper of Henzinger, Klein, Rao and Subramanian (1997), it was shown that planar graphs admit a linear time single-source shortest path algorithm. Their algorithm unfortunately does n…

Read Paper →
Computer Science Preprint PDF DOI

Simple minimally unsatisfiable subsets of 2-CNFs

Oliver Kullmann, Edward Clewer · 2026

We present a study of minimal unsatisfiable subsets (MUSs) of 2-CNF Boolean formulas, building on the Abbasizanjani-Kullmann classification of minimally unsatisfiable 2-CNFs (2-MUs). We start by givin…

Read Paper →
Computer Science Preprint PDF DOI

LLY Ricci Reweighting in Stochastic Block Models: Uniform Curvature Concentration and Finite-Horizon Tracking

Varun Kotharkar · 2026

We study curvature-driven edge reweighting for community recovery in the balanced two-block stochastic block model. Given a graph G with initial weights equal to the adjacency matrix, we iteratively u…

Read Paper →
Computer Science Preprint PDF DOI

Teen Vigilance: Navigating Risky Social Interactions on Discord

Elena Koung, Yunhan Liu, Zinan Zhang, Xinning Gui, Yubo Kou · 2026

Teenagers are avid users of Discord, a fast growing platform for synchronous communication where they often interact with strangers. Because Discord combines private DMs, semi-private voice channels, …

Read Paper →
Computer Science Preprint PDF DOI

Remarks on Algebraic Reconstruction of Types and Effects

Patrycja Balik, Szymon Jedras, Piotr Polesiuk · 2026

In their 1991 paper "Algebraic Reconstruction of Types and Effects," Pierre Jouvelot and David Gifford presented a type-and-effect reconstruction algorithm based on an algebraic structure of effects. …

Read Paper →
Computer Science Preprint PDF DOI

Classifiers in High Dimensional Hilbert Metrics

Aditya Acharya, Auguste H. Gezalyan, David M. Mount · 2026

Classifying points in high dimensional spaces is a fundamental geometric problem in machine learning. In this paper, we address classifying points in the $d$-dimensional Hilbert polygonal metric. The …

Read Paper →
Computer Science Preprint PDF DOI

Equivalent Instances for Scheduling and Packing Problems

Klaus Jansen, Kai Kahler, Corinna Wambsganz · 2025

Two instances $(I,k)$ and $(I',k')$ of a parameterized problem $P$ are equivalent if they have the same set of solutions (static equivalent) or if the set of solutions of $(I,k)$ can be constructed by…

Read Paper →
Computer Science Preprint PDF DOI

The Support of Bin Packing is Exponential

Klaus Jansen, Felix Ohnesorge, Lis Pirotton, Malte Tutas · 2025

Consider the classical Bin Packing problem with $d$ different item sizes $s_i$ and amounts of items $a_i.$ The support of a Bin Packing solution is the number of differently filled bins. In this work,…

Read Paper →
Computer Science Preprint PDF DOI

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing

Klaus Jansen, Felix Ohnesorge, Lis Pirotton · 2025

Consider a high-multiplicity Bin Packing instance $I$ with $d$ distinct item types. In 2014, Goemans and Rothvoss gave an algorithm with runtime ${{|I|}^2}^{O(d)}$ for this problem~[SODA'14], where $|…

Read Paper →
Computer Science Preprint PDF DOI

Formalizing Computational Paths and Fundamental Groups in Lean

Arthur F. Ramos, Anjolina G. de Oliveira, Ruy J. G. B. de Queiroz, Tiago M. L. de Veras · 2025

Computational paths treat propositional equality as explicit paths built from labelled deduction steps and rewrite rules. This view originates in work by de Queiroz and collaborators [1] and yields a …

Read Paper →
Computer Science Preprint PDF DOI

Steiner Forest: A Simplified Better-Than-2 Approximation

Anupam Gupta, Vera Traub · 2025

In the Steiner Forest problem, we are given a graph with edge lengths, and a collection of demand pairs; the goal is to find a subgraph of least total length such that each demand pair is connected in…

Read Paper →
Computer Science Preprint PDF DOI

Polynomial-Time Algorithms for Computing the Nucleolus: An Assessment

Holger I. Meinhardt · 2025

Recently, Maggiorano et al. (2025) claimed that they have developed a strongly polynomial-time combinatorial algorithm for the nucleolus in convex games that is based on the reduced game approach and …

Read Paper →
Computer Science Preprint PDF DOI

The Future of Food: How Artificial Intelligence is Transforming Food Manufacturing

Xu Zhou, Ivor Prado, AIFPDS participants, Ilias Tagkopoulos · 2025

Artificial intelligence is accelerating a new era of food innovation, connecting data from farm to consumer to improve formulation, processing, and health outcomes. Recent advances in deep learning, n…

Read Paper →
Computer Science Preprint PDF DOI

Online 3-Taxi on General Metrics

Christian Coester, Tze-Yang Poon · 2025

The online $k$-taxi problem, introduced in 1990 by Fiat, Rabani and Ravid, is a generalization of the $k$-server problem where $k$ taxis must serve a sequence of requests in a metric space. Each reque…

Read Paper →
Computer Science Preprint PDF DOI

Bilateralist base-extension semantics with incompatible proofs and refutations

Victor Barroso-Nascimento, Maria Osorio Costa, Elaine Pimentel · 2025

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive var…

Read Paper →
Page 1 of 14 Next →