English
Related papers

Related papers: Constant RMR Recoverable Mutex under System-wide C…

200 papers

Transformers have been established as the de-facto backbones for most recent advances in sequence modeling, mainly due to their growing memory capacity that scales with the context length. While plausible for retrieval tasks, it causes…

Machine Learning · Computer Science 2026-03-02 Ali Behrouz , Zeman Li , Yuan Deng , Peilin Zhong , Meisam Razaviyayn , Vahab Mirrokni

We study a catching-up algorithm for a class of differential inclusions driven by maximal monotone operators with continuous perturbations. Using a decomposition of the monotone operator into the closed convex hull of its single-valued part…

Optimization and Control · Mathematics 2026-04-14 Tan H. Cao , Hassan Saoud

Hardware faults, specifically bit-flips in quantized weights, pose a severe reliability threat to Large Language Models (LLMs), often triggering catastrophic model collapses. We demonstrate that this vulnerability fundamentally stems from…

Cryptography and Security · Computer Science 2026-03-18 Deng Liu , Song Chen

The rapid integration of Multimodal Large Language Models (MLLMs) into critical applications is increasingly hindered by persistent safety vulnerabilities. However, existing red-teaming benchmarks are often fragmented, limited to…

Cryptography and Security · Computer Science 2026-01-13 Xin Wang , Yunhao Chen , Juncheng Li , Yixu Wang , Yang Yao , Tianle Gu , Jie Li , Yan Teng , Yingchun Wang , Xia Hu

The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard problem that combines the problem of partitioning a group of vertices of a bipartite graph into disjoint subsets with limited size and the classical Min-Max Weighted…

Data Structures and Algorithms · Computer Science 2022-01-26 Yuxuan Wang , Jinyao Xie , Jiongzhi Zheng , Kun He

Most Relevant Explanation (MRE) is a method for finding multivariate explanations for given evidence in Bayesian networks [12]. This paper studies the theoretical properties of MRE and develops an algorithm for finding multiple top MRE…

Artificial Intelligence · Computer Science 2012-05-14 Changhe Yuan , Xiaolu Liu , Tsai-Ching Lu , Heejin Lim

This paper studies randomized approximation algorithm for a variant of the set cover problem called minimum submodular cost partial multi-cover (SCPMC), in which each element $e$ has a covering requirement $r_e$ and a profit $p_e$, and the…

Data Structures and Algorithms · Computer Science 2017-02-02 Yishuo Shi , Zhao Zhang , Ding-Zhu Du

Reservoir computing (RC) offers a neuromorphic framework that is particularly effective for processing spatiotemporal signals. Known for its temporal processing prowess, RC significantly lowers training costs compared to conventional…

Neural and Evolutionary Computing · Computer Science 2025-03-24 Ankur Singh , Sanghyeon Choi , Gunuk Wang , Maryaradhiya Daimari , Byung-Geun Lee

We consider the approximation of the 2D frictionless contact problem in elasticity using the Virtual Element Methods (VEMs). To overcome the volumetric locking phenomenon in the nearly incompressible case, we adopt a mixed…

Numerical Analysis · Mathematics 2026-01-07 C. Lovadina , L. Molinari

Ensuring safety of nonlinear systems under model uncertainty and external disturbances is crucial, especially for real-world control tasks. Predictive methods such as robust model predictive control (RMPC) require solving nonconvex…

Systems and Control · Electrical Eng. & Systems 2023-11-14 Zeyang Li , Chuxiong Hu , Weiye Zhao , Changliu Liu

A complexity-adaptive tree search algorithm is proposed for $\boldsymbol{G}_N$-coset codes that implements maximum-likelihood (ML) decoding by using a successive decoding schedule. The average complexity is close to that of the successive…

Information Theory · Computer Science 2021-09-03 Peihong Yuan , Mustafa Cemil Coşkun

We study the universality and inclusion problems for register automata over equality data. We show that the universality and the inclusion problems can be solved with 2-EXPTIME complexity when the input automata are without guessing and…

Formal Languages and Automata Theory · Computer Science 2021-01-05 Corentin Barloy , Lorenzo Clemente

This paper presents a novel coding scheme for distributed storage systems containing nodes with adversarial errors. The key challenge in such systems is the propagation of erroneous data from a single corrupted node to the rest of the…

Information Theory · Computer Science 2012-07-17 Natalia Silberstein , Ankit Singh Rawat , Sriram Vishwanath

New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code…

Information Theory · Computer Science 2017-03-17 Ilya Dumer

Saturated locks often degrade the performance of a multithreaded application, leading to a so-called scalability collapse problem. This problem arises when a growing number of threads circulating through a saturated lock causes the overall…

Operating Systems · Computer Science 2019-07-15 Dave Dice , Alex Kogan

We design a deterministic compiler that makes any computation in the Congested Clique model robust to a constant fraction $\alpha<1$ of adversarial crash faults. In particular, we show how a network of $n$ nodes can compute any circuit of…

Data Structures and Algorithms · Computer Science 2025-08-13 Keren Censor-Hillel , Orr Fischer , Ran Gelles , Pedro Soto

Maximum Likelihood (ML) algorithms, for the joint estimation of synchronization impairments and channel in Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) system, are investigated in this work. A system…

Information Theory · Computer Science 2012-10-30 Renu Jose , K. V. S. Hari

In modern practical data centers, storage nodes are usually organized into equally sized groups, which is called racks. The cost of cross-rack communication is much more expensive compared with the intra-rack communication cost. The codes…

Information Theory · Computer Science 2019-11-20 Lingfei Jin , Gaojun Luo , Chaoping Xing

Retrieval-Augmented Language Models (RALMs) have significantly improved performance in open-domain question answering (QA) by leveraging external knowledge. However, RALMs still struggle with unanswerable queries, where the retrieved…

Computation and Language · Computer Science 2024-08-09 Seong-Il Park , Seung-Woo Choi , Na-Hyun Kim , Jay-Yoon Lee

This is the second paper in a series in which we develop machine learning (ML) moment closure models for the radiative transfer equation (RTE). In our previous work \cite{huang2021gradient}, we proposed an approach to directly learn the…

Numerical Analysis · Mathematics 2021-06-01 Juntao Huang , Yingda Cheng , Andrew J. Christlieb , Luke F. Roberts , Wen-An Yong
‹ Prev 1 8 9 10 Next ›