Expertini Research Research

Browse Research Papers

1,424+ open-access research outputs.

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

Compressing ACAS-Xu Lookup Tables with Binary Decision Diagrams

Martin Boniol (ISAE-SUPAERO), Julien Brunel, Jean-Baptiste Chaudron (ISAE-SUPAERO), Christophe Garion (ISAE-SUPAERO), Xavier Thirioux (ISAE-SUPAERO) ยท 2026

The Airborne Collision Avoidance System Xu (ACAS-Xu) relies on large certified Look-Up Tables (LUTs) that encode the exact decision logic used in operation. Neural-network-based approximations have beโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Constructive Separations from Gate Elimination

Marco Carmosino, Ngu Dang, Tim Jackman ยท 2026

Gate elimination is the primary technique for proving explicit lower bounds against general Boolean circuits, including Li and Yang's state-of-the-art $3.1n - o(n)$ bound for affine dispersers (STOC 2โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics

Saswata Jana, Partha Sarathi Mandal ยท 2026

Collaboration between drones and trucks in a last-mile delivery system offers numerous benefits and reduces many challenges of the traditional delivery system. Here, we introduce Drone-Delivery Packinโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

SDNGuardStack: An Explainable Ensemble Learning Framework for High-Accuracy Intrusion Detection in Software-Defined Networks

Ashikuzzaman, Md. Saifuzzaman Abhi, Mahabubur Rahman, Md. Manjur Ahmed, Md. Mehedi Hasan, Md. Ahsan Arif ยท 2026

Software-Defined Networking (SDN) is another technology that has been developing in the last few years as a relevant technique to improve network programmability and administration. Nonetheless, its cโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two

Faruk Alpay, Levent Sarioglu ยท 2026

We study a list-constrained extension of modular equation deletion over powers of two, called Coset-List Min-2-Lin$^{\pm}$ over $\mathbb{Z}/2^d\mathbb{Z}$. Each variable is restricted to a dyadic coseโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

CoopEval: Benchmarking Cooperation-Sustaining Mechanisms and LLM Agents in Social Dilemmas

Emanuel Tewolde, Xiao Zhang, David Guzman Piedrahita, Vincent Conitzer, Zhijing Jin ยท 2026

It is increasingly important that LLM agents interact effectively and safely with other goal-pursuing agents, yet, recent works report the opposite trend: LLMs with stronger reasoning capabilities behโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Driving Engagement in Daily Fantasy Sports with a Scalable and Urgency-Aware Ranking Engine

Unmesh Padalkar ยท 2026

In daily fantasy sports (DFS), match participation is highly time-sensitive. Users must act within a narrow window before a game begins, making match recommendation a time-critical task to prevent misโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Optimal FPT-Approximability for Modular Linear Equations

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrom ยท 2026

We show optimal FPT-approximability results for solving almost satisfiable systems of modular linear equations, completing the picture of the parameterized complexity and FPT-approximability landscapeโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

ClawXiv: a signed archival workflow and distributed publication architecture for human--AI collaborative research

Andras Kornai ยท 2026

We propose \emph{ClawXiv}, a workflow and archive architecture for mixed human--AI research. The immediate problem is not only public dissemination of preprints, but also reliable migration from volatโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

AudioGS: Spectrogram-Based Audio Gaussian Splatting for Sound Field Reconstruction

Chunhao Bi, Houqiang Zhong, Zhixin Xu, Li Song, Zhengxue Cheng ยท 2026

Spatial audio is fundamental to immersive virtual experiences, yet synthesizing high-fidelity binaural audio from sparse observations remains a significant challenge. Existing methods typically rely oโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances

Renan Fernando Franco da Silva, Vinicius Loti de Lima, Rafael C. S. Schouery, Jean-Francois Cote, Manuel Iori ยท 2026

Cutting and packing problems are fundamental in manufacturing and logistics, as they aim to minimize waste and improve efficiency. The Cutting Stock Problem (CSP) concerns material cutting, whereas thโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

DAG Projections: Reducing Distance and Flow Problems to DAGs

Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak ยท 2026

We show that every directed graph $G$ with $n$ vertices and $m$ edges admits a directed acyclic graph (DAG) with $m^{1+o(1)}$ edges, called a DAG projection, that can either $(1+1/\text{polylog} (n))$โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Subset Balancing and Generalized Subset Sum via Lattices

Yiming Gao, Yansong Feng, Honggang Hu, Yanbin Pan ยท 2026

We study the Subset Balancing problem: given $x \in \mathbb{Z}^n$ and a coefficient set $C \subseteq \mathbb{Z}$, find a nonzero vector $c \in C^n$ such that $c\cdot x = 0$. The standard meet-in-the-mโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Hotspot-Aware Scheduling of Virtual Machines with Overcommitment for Ultimate Utilization in Cloud Datacenters

Jiaxi Wu, Pavel Popov, Wenquan Yang, Andrei Gudkov, Elizaveta Ponomareva, Xinming Han, Yunzhe Qiu, Jie Song, Stepan Romanov ยท 2026

We address the problem of under-utilization of resources in datacenters during cloud operations, specifically focusing on the challenge of online virtual machine (VM) scheduling. Rather than followingโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Beyond Latency: A System-Level Characterization of MPC and FHE for PPML

Pengzhi Huang, Kiwan Maeng, G. Edward Suh ยท 2026

Privacy protection has become an increasing concern in modern machine learning applications. Privacy-preserving machine learning (PPML) has attracted growing research attention, with approaches such aโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Online Packing of Orthogonal Polygons

Tim Gerlach, Benjamin Hennies, Linda Kleist ยท 2026

While rectangular and box-shaped objects dominate the classic discourse of theoretic investigations, a fascinating frontier lies in packing more complex shapes. Given recent insights that convex polygโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

WarPGNN: A Parametric Thermal Warpage Analysis Framework with Physics-aware Graph Neural Network

Haotian Lu, Jincong Lu, Sachin Sachdeva, Sheldon X.-D. Tan ยท 2026

With the advent of system-in-package (SiP) chiplet-based design and heterogeneous 2.5D/3D integration, thermal-induced warpage has become a critical reliability concern. While conventional numerical aโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

SimCert: Probabilistic Certification for Behavioral Similarity in Deep Neural Network Compression

Jingyang Li, Fu Song, Guoqiang Li ยท 2026

Deploying Deep Neural Networks (DNNs) on resource-constrained embedded systems requires aggressive model compression techniques like quantization and pruning. However, ensuring that the compressed modโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

When Scanners Lie: Evaluator Instability in LLM Red-Teaming

Lidor Erez, Omer Hofman, Tamir Nizri, Roman Vainshtein ยท 2026

Automated LLM vulnerability scanners are increasingly used to assess security risks by measuring different attack type success rates (ASR). Yet the validity of these measurements hinges on an often-ovโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling

Karl Bringmann, Anita Durr, Karol Wegrzycki ยท 2026

Bin Packing with $k$ bins is a fundamental optimisation problem in which we are given a set of $n$ integers and a capacity $T$ and the goal is to partition the set into $k$ subsets, each of total sum โ€ฆ

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