Expertini Research Research

Browse Research Papers

9,786+ open-access research outputs.

โœ• Clear
๐Ÿ” w. farr ๐Ÿ“‚ Computer Science
Showing 9786 results for "w. farr" in Computer Science
Computer Science Preprint PDF DOI

Claw-Eval-Live: A Live Agent Benchmark for Evolving Real-World Workflows

Chenxin Li, Zhengyang Tang, Huangxin Lin, Yunlong Lin, Shijue Huang, Shengyuan Liu, Bowen Ye, Rang Li, Lei Li, Benyou Wang, Yixuan Yuan ยท 2026

LLM agents are expected to complete end-to-end units of work across software tools, business services, and local workspaces. Yet many agent benchmarks freeze a curated task set at release time and graโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Latent Adversarial Detection: Adaptive Probing of LLM Activations for Multi-Turn Attack Detection

Prashant Kulkarni ยท 2026

Multi-turn prompt injection follows a known attack path -- trust-building, pivoting, escalation but text-level defenses miss covert attacks where individual turns appear benign. We show this attack paโ€ฆ

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

Social Media Data Toolkit: Standardization and Anonymization of Social Network Datasets

Ali Najafi, Letizia Iannucci, Mikko Kivela, Onur Varol ยท 2026

The rapid diversification of social media platforms and the increasing restrictions on official APIs have significantly complicated cross-platform analysis. Researchers are often forced to rely on hetโ€ฆ

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

RCW-CIM: A Digital CIM-based LLM Accelerator with Read-Compute/Write

Yan-Cheng Guo, Tian-Sheuan Chang, Jian-Wei Su ยท 2026

Digital computing-in-memory (DCIM) has emerged as a promising solution for large language model (LLM) acceleration by minimizing data transfers between external DRAM and on-chip accelerators while maiโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

REBENCH: A Procedural, Fair-by-Construction Benchmark for LLMs on Stripped-Binary Types and Names (Extended Version)

Jun Yeon Won, Xin Jin, Shiqing Ma, Zhiqiang Lin ยท 2026

Large Language Models (LLMs) have achieved remarkable progress in recent years, driving their adoption across a wide range of domains, including computer security. In reverse engineering, LLMs are incโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Truthful-in-Expectation Mechanisms for MMS Approximation

Moshe Babaioff, Uriel Feige, Noam Manaker Morag ยท 2026

We study fair allocation of indivisible goods among strategic agents with additive valuations. Motivated by impossibility results for deterministic truthful mechanisms, we focus on randomized mechanisโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Will It Break in Production? Metric-Driven Prediction of Residual Defects in Python Systems

Giuseppe De Rosa, Pietro Liguori ยท 2026

Python's dynamic nature complicates testing and increases the possibility that some defects evade detection, so an effective fault prediction becomes essential. We examine whether post-release faults โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Distributional Learning of Graph Languages Generated by Fixed-Interface Clause Systems

Takayoshi Shoudai, Satoshi Matsumoto, Yusuke Suzuki, Tomoyuki Uchida ยท 2026

Distributional learning provides a framework for studying the learnability of structured languages from positive data. In this paper, we extend this framework to graph languages generated by fixed-intโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Towards Low-Cost Low-Power Activity-Aware Soil Moisture Sensing Platform for Large-scale Farming

Jack Thoene, Omar Kamil, Thekra Alkadee, Nivedita Arora ยท 2026

Deep understanding of a field's soil moisture content is the leading indicator for predicting crop yields and making data driven decisions for irrigation and application of topical chemicals for drougโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width

Benjamin Bergougnoux, Vera Chekan, Stefan Kratsch ยท 2026

In this work we contribute to the study of the fine-grained complexity of problems parameterized by multi-clique-width, which was initiated by F\"urer [ITCS 2017] and pursued further by Chekan and Kraโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study

Tian Bai, Fedor V. Fomin, Petr A. Golovach, Yash Hiren More, Simon Wietheger ยท 2026

Rank aggregation seeks a representative permutation for a collection of rankings and plays a central role in areas such as social choice, information retrieval, and computational biology. Two fundamenโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

SimdQuickHeap: The QuickHeap Reconsidered

Johannes Breitling, Ragnar Groot Koerkamp, Marvin Williams ยท 2026

Priority queues are data structures that maintain a dynamic collection of elements and allow inserting new elements and removing the smallest element. The most widely known and used priority queue is โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

The Attention Market: Interpreting Online Fair Re-ranking as Manifold Optimization under Walrasian Equilibrium

Chen Xu, Wei Chu, Wenyu Hu, Fengran Mo, Jun Xu, Maarten de Rijke ยท 2026

Fair re-ranking aims to promote long-tail items and enhance diversity within groups in information retrieval. While previous research on online fairness-aware re-ranking has shown promising outcomes, โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Practical Insights into Fair Comparison and Evaluation Frame for Neutral-Atom Compilers

Emil Khusainov, Yanbin Chen, Jonas Winklmann, Helmut Seidl, Christian B. Mendl ยท 2026

Neutral-atom quantum computing is among the most promising platforms for scalable quantum computation, and compilation toolchains are crucial for leveraging capabilities such as qubit shuttling and paโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

FusionCIM: Accelerating LLM Inference with Fusion-Driven Computing-in-Memory Architecture

Zihao Xuan, Jia Chen, Yewen Li, Wei Xuan, Hegan Chen, Xiao Huo, Fengbin Tu ยท 2026

In this paper, we propose FusionCIM, an operator-fusion-driven compute-in-memory (CIM) accelerator architecture for efficient and scalable LLM inference, with three key innovations: (1) a hybrid CIM pโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Performance Analysis of Pinching Antenna Systems Enabled NOMA Communications

Xinwei Yue, Xinglun Tao, Jingjing Zhao, Xianfu Lei, Yuanwei Liu, Zhiguo Ding ยท 2026

Pinching antenna systems (PASS) have the advantages in the perspective of flexible antenna reconfiguration, line-of-sight (LoS) creation, and scalability features. To highlight the ascendancy of PASS,โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Making AI-Assisted Grant Evaluation Auditable without Exposing the Model

Kemal Bicakci ยท 2026

Public agencies are beginning to consider large language models (LLMs) as decision-support tools for grant evaluation. This creates a practical governance problem: the model and scoring rubric should โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Hardware Generation and Exploration of Lookup Table-Based Accelerators for 1.58-bit LLM Inference

Robin Geens, Joran Heldens, Joren Dumoulin, Marian Verhelst ยท 2026

Ternary weight quantization (e.g., BitNet b1.58) offers a promising path to mitigate the memory bandwidth bottleneck in Large Language Model (LLM) inference. However, conventional compute platforms laโ€ฆ

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