Expertini Research Research

Browse Research Papers

19,560+ open-access research outputs.

✕ Clear
🔍 d. s. wang 📂 Computer Science
Showing 19560 results for "d. s. wang" in Computer Science
Computer Science Preprint PDF DOI

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size

Susanna F. de Rezende, David Engstrom, Yassine Ghannane, Kilian Risse · 2026

We prove superpolynomial length lower bounds for the semantic tree-like Frege refutation system with bounded line size. Concretely, for any function $n^{2-\varepsilon} \leq s(n) \leq 2^{n^{1-\varepsil…

Read Paper →
Computer Science Preprint PDF DOI

FlashRT: Towards Computationally and Memory Efficient Red-Teaming for Prompt Injection and Knowledge Corruption

Yanting Wang, Chenlong Yin, Ying Chen, Jinyuan Jia · 2026

Long-context large language models (LLMs)-for example, Gemini-3.1-Pro and Qwen-3.5-are widely used to empower many real-world applications, such as retrieval-augmented generation, autonomous agents, a…

Read Paper →
Computer Science Preprint PDF DOI

Index-Assisted Stratified Sampling for Online Aggregation

Yunnan Yu, Zhuoyue Zhao · 2026

Ad-hoc queries over frequently updated data in a flat schema are common in real-time data analysis applications and often require very low latency. Online aggregation can achieve so by providing appro…

Read Paper →
Computer Science Preprint PDF DOI

On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic

Ugo Dal Lago, Guido Fiorillo, Paolo Pistone · 2026

The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature h…

Read Paper →
Computer Science Preprint PDF DOI

Distributed Santa Claus via Global Rounding

Tijn de Vos, Leo Wennmann, Malte Baumecker, Yannic Maus, Florian Schager · 2026

In this paper, we consider the Santa Claus problem in the CONGEST model. This NP-hard problem can be modeled as a bipartite graph of children and gifts where an edge indicates that a child desires a g…

Read Paper →
Computer Science Preprint PDF DOI

From Mirage to Grounding: Towards Reliable Multimodal Circuit-to-Verilog Code Generation

Guang Yang, Xing Hu, Xiang Chen, Xin Xi · 2026

Multimodal large language models (MLLMs) are increasingly used to translate visual artifacts into code, from UI mockups into HTML to scientific plots into Python scripts. A circuit diagram can be view…

Read Paper →
Computer Science Preprint PDF DOI

Simpler and Improved Replacement Path Coverings

Davide Bilo, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Martin Schirneck · 2026

An important tool in the design of fault-tolerant graph data structures are $(L,f)$-replacement path coverings (RPCs). An RPC is a family $\mathcal{G}$ of subgraphs of a given graph $G$ such that, for…

Read Paper →
Computer Science Preprint PDF DOI

D-Rex : Diffusion Rendering for Relightable Expressive Avatars

Timo Teufel, Xilong Zhou, Umar Iqbal, Jan Kautz, Marc Habermann, Vladislav Golyanik, Christian Theobalt · 2026

We present D-Rex, a person-specific framework for photorealistic, relightable, expressive, and animatable full-body human avatars with free-viewpoint rendering. Existing methods for relightable full-b…

Read Paper →
Computer Science Preprint PDF DOI

AnTi-MiCS: Analytical Framework for Bounding Time in Embedded Mixed-Criticality Systems

Behnaz Ranjbar, Akash Kumar · 2026

In Mixed-Criticality (MC) systems, although the high Worst-Case Execution Time (WCET) serves as a conservative upper bound representing the task's maximum execution time under all conditions, obtainin…

Read Paper →
Computer Science Preprint PDF DOI

AME-PIM: Can Memory be Your Next Tensor Accelerator?

Emanuele Venieri, Simone Manoni, Alberto Florian, Jaehyun Park, Kyomin Sohn, Andrea Bartolini · 2026

High Bandwidth Memory with Processing-in-Memory (HBM-PIM) offers an opportunity to reduce data movement by executing computation directly inside memory, but current commercial platforms expose limited…

Read Paper →
Computer Science Preprint PDF DOI

A Generalisation of Goursat's Algorithm for Integration in Finite Terms

Sam Blake · 2026

We give a self-contained, modern exposition of \'Edouard Goursat's 1887 theorem on pseudo-elliptic integrals -- those integrals of the form $\int F(t)\,\d t/\sqrt{R(t)}$ with $R$ a cubic or quartic po…

Read Paper →
Computer Science Preprint PDF DOI

Toward a Characterization of Simulation Between Arithmetic Theories

Hunter Monroe · 2026

We study when a sound arithmetic theory $\mathcal S{\supseteq}S^1_2$ with polynomial-time decidable axioms efficiently proves the bounded consistency statements $Con_{\mathcal S{+}\phi}(n)$ for a true…

Read Paper →
Computer Science Preprint PDF DOI

Temporal Routing in Static Networks: The Schedule Completion Problem

Michelle Doring, Niklas Mohrin, George Skretas · 2026

We introduce the TemporallyEdgeDisjointScheduleCompletion (TEDSC) problem in which we need to cover a set of temporal edge demands $D$ by routing $k$ temporal walks through a directed static graph whi…

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

Thinking like a business: Reconfiguring relationships to sustain open data infrastructures

Kathleen Gregory, Dorothea Strecker · 2026

Sustaining open data infrastructures over time is a complex puzzle, involving dynamic funding models and relationships with customers, collaborators, and competitors. Despite their importance, these m…

Read Paper →
Computer Science Preprint PDF DOI

VitaLLM: A Versatile, Ultra-Compact Ternary LLM Accelerator with Dependency-Aware Scheduling

Zi-Wei Lin, Tian-Sheuan Chang · 2026

Deploying Large Language Models (LLMs) on resource-constrained edge devices faces critical bottlenecks in memory bandwidth and power consumption. While ternary quantization (e.g., BitNet b1.58) signif…

Read Paper →
Computer Science Preprint PDF DOI

Predicting Upcoming Stuttering Events from Three-Second Audio: Stratified Evaluation Reveals Severity-Selective Precursors, and the Model Deploys Fully On-Device

Nazar Kozak · 2026

Audio-based stuttering systems to date have been trained for detection -- what disfluency is present now -- leaving prediction, the capability needed for closed-loop intervention, unstudied at deploya…

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

Adaptive Self-Organization in Anonymous Dynamic Networks

Garrett Parzych, Joshua J. Daymude · 2026

We introduce the problem of adaptive self-organization in which the nodes of an anonymous, synchronous dynamic network must distributively change the collective distribution of their responses (or "co…

Read Paper →
Page 1 of 978 Next →