ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “merge times”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.SEEmpiricalRecentJul 8, 2026

On the Correctness of Software Merge

Akira Mori, Masatomo Hashimoto

The paper introduces a new structural merge tool that ensures parsability and universality in comparison to existing tools, resulting in fewer incorrect merge results.

View →
cs.DBcs.DCEmpiricalRecentJun 12, 2026

Vivace: Exact Temporal OLAP over Interval Histories via Independent Serverless Execution

Woohyeok Park, Taeyoon Kim, Hyunjoon Kim, Kungyong Lee

This paper presents Vivace, a serverless system for exact temporal OLAP over interval histories, which addresses the issues of incomplete data and incorrect answers in serverless functions.

View →
cs.CLRecentJun 1, 2026

ResMerge: Residual-based Spectral Merging of Large Language Models

Yandu Sun, Zhiyan Hou, Haokai Ma, Yuheng Jia +5 more

ResMerge proposes a residual-based spectral merging framework that improves the combination of multiple reinforcement learning (RL) expert models by stabilizing the aggregation process using a residua…

View →
cs.SEEmpiricalRecentJun 18, 2026

OxyMake: A Formally-Specified, Content-Addressable Workflow Engine

Emmanuel Sérié

OxyMake is a content-addressed cache key workflow engine that replaces mtime with a BLAKE3 hash for caching decisions, eliminating spurious re-runs and traveling across machines and shared caches.

View →
cs.CRRecentApr 1, 2026

When Safe Models Merge into Danger: Exploiting Latent Vulnerabilities in LLM Fusion

Jiaqing Li, Zhibo Zhang, Shide Zhou, Yuxi Li +2 more

The paper introduces TrojanMerge, a framework demonstrating that model merging can be exploited to systematically compromise the safety alignment of multiple individually safe LLMs.

View →
cs.DCEmpiricalRecentJul 2, 2026

Elasticity in Parallel Sparse Triangular Solve

Raphael S. Steiner, Christos K. Matzoros, Pál András Papp, Toni Böhnlein +1 more

This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…

View →
cs.CRcs.LGRecentJun 2, 2026

RogueMerge: Robust and Unified Attacks against LLM Model Merging

Jinghuai Zhang, Yetian He, Kunlin Cai, Han Zhao +2 more

RogueMerge introduces a unified framework to robustly attack LLM model merging by addressing the challenges of autoregressive decoding, unknown merging configurations, and prompt generalization, signi…

View →
cs.DSTheoreticalRecentJun 19, 2026

Online Stacking with a Few Load/Unload Points

Martin Olsen

A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.

View →
cs.CLcs.AIRecentMay 31, 2026

TimeSage-MT: A Multi-Turn Benchmark for Evaluating Agentic Time Series Reasoning

Yaxuan Kong, Qingren Yao, Yuqi Nie, Yichen Li +6 more

The paper introduces TimeSage-MT, a comprehensive multi-turn benchmark designed to rigorously test an LLM agent's ability to perform complex, evolving time series analysis, revealing critical gaps in…

View →
cs.IRcs.AIRecentJun 1, 2026

Time-Aware Diffusion based on Preference Disentanglement for Generative Recommendation

Bangguo Zhu, Peng Huo, Yuanbo Zhao, Zhicheng Du +2 more

The paper proposes TDPM, a time-aware diffusion model for generative recommendation, which significantly improves recommendation accuracy by explicitly modeling the non-stationary, time-evolving natur…

View →
cs.FLcs.CRRecentMar 27, 2026

Evolution-Based Timed Opacity under a Universal Observation Model

Zhe Zhang, Martijn Goorden, Michel Reniers

The paper establishes a unified framework for timed opacity by introducing a universal observation model and defining evolution-based timed opacity, proving its relationship to existing opacity defini…

View →
cs.DBcs.IREmpiricalRecentJul 17, 2026

Efficient and Effective In-place Graph-based Vector Index Updates

Haotian Liu, Yujun He, Bo Tang

This paper proposes Yi, a system for efficient and effective in-place updates in large-scale vector indexing, achieving higher update and search throughput than state-of-the-art methods.

View →
cs.SEEmpiricalRecentJul 8, 2026

Rethinking Code Performance Benchmarks for LLMs

Nhat Minh Le, Yisen Xu, Zhijie Wang, Tse-Hsun +1 more

This paper evaluates the performance of large language models on popular benchmarks and finds that only a small percentage of the performant implementations are significantly faster than canonical sol…

View →
cs.DBcs.AIcs.CRRecentMay 22, 2026

CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces

Joydeep Chandra

CHRONOS is a novel three-layer architecture designed to address coupled failures in temporal data marketplaces by integrating temporal decay, changepoint-aware pricing, and differential privacy for ro…

View →
cs.LGstat.MLEmpiricalRecentJul 17, 2026

Do Generative Models Keep Time? A Time-Aware Evaluation of Synthetic Sequential Tabular Data

Kiwan Kwon, Kangmin Kim, Hojin Lee, Yeseong Jung +4 more

This paper proposes a taxonomy-guided evaluation protocol for temporal fidelity in synthetic sequential tabular data, measuring timestamp validity, cross-sectional structure, within-entity dynamics, a…

View →
cs.AIRecentMay 28, 2026

Meta-Programming for Linear-time Temporal Answer Set Programming

Susana Hahn, Amade Nems, Javier Romero, Torsten Schaub

The paper proposes a flexible meta-programming framework to declaratively operationalize and explore varied temporal logics, such as TEL, MEL, and DEL, within standard Answer Set Programming systems.

View →
cs.IRcs.CLEmpiricalRecentJul 9, 2026

Improving Ad-hoc Search Effectiveness for Conversational Information Retrieval via Model Merging

Ahmed Rayane Kebir, Jose G. Moreno, Lynda Tamine

This paper introduces model merging as a training-free strategy for designing a single retrieval model that operates across both ad-hoc and conversational settings, improving ad-hoc search capabilitie…

View →
cs.AIcs.CLcs.IRRecentMay 31, 2026

Don't Ask the LLM to Track Freshness: A Deterministic Recipe for Memory Conflict Resolution

Vikas Reddy, Sumanth Challaram

The paper proposes a deterministic, version-aware aggregation method that significantly outperforms existing LLM-based systems for resolving memory conflicts in fact consolidation tasks.

View →