English
Related papers

Related papers: Linear-time Minimization of Wheeler DFAs

200 papers

Efficient compression of correlated data is essential to minimize communication overload in multi-sensor networks. In such networks, each sensor independently compresses the data and transmits them to a central node due to limited…

Decentralized federated learning (DFL) is a promising machine learning paradigm for bringing artificial intelligence (AI) capabilities to the network edge. Running DFL on top of edge networks, however, faces severe performance challenges…

Networking and Internet Architecture · Computer Science 2025-04-22 Tingyang Sun , Tuan Nguyen , Ting He

Classification accuracy provided by a machine learning model depends a lot on the feature set used in the learning process. Feature Selection (FS) is an important and challenging pre-processing technique which helps to identify only the…

Machine Learning · Computer Science 2020-09-01 Ritam Guha , Manosij Ghosh , Shyok Mutsuddi , Ram Sarkar , Seyedali Mirjalili

Practical applicability of quantum optimisation on near term devices is constrained by limited qubit counts and hardware noise, which restricts the scalability of quantum optimisation algorithms for combinatorial problems. The simulation of…

Quantum Physics · Physics 2026-05-01 Namasi G Sankar , Georgios Miliotis , Simon Caton

Real-world data typically contain repeated and periodic patterns. This suggests that they can be effectively represented and compressed using only a few coefficients of an appropriate basis (e.g., Fourier, Wavelets, etc.). However, distance…

Machine Learning · Statistics 2014-05-26 Michail Vlachos , Nikolaos Freris , Anastasios Kyrillidis

Future wireless communication systems must simultaneously address multiple challenges to ensure accurate data detection, deliver high Quality of Service (QoS), adding enable a high data transmission with low system design. Additionally,…

Information Theory · Computer Science 2024-10-03 Amina Darghouthi , Abdelhakim Khlifi , Belgacem Chibani

The communication matrix for two-way deterministic finite automata (2DFA) with $n$ states is defined for an automaton over a full alphabet of all $(2n+1)^n$ possible symbols: its rows and columns are indexed by strings, and the entry $(u,…

Formal Languages and Automata Theory · Computer Science 2023-12-12 Semyon Petrov , Fedor Petrov , Alexander Okhotin

Real-world problems of operations research are typically high-dimensional and combinatorial. Linear programs are generally used to formulate and efficiently solve these large decision problems. However, in multi-period decision problems, we…

Machine Learning · Computer Science 2019-02-27 Wouter van Heeswijk , Han La Poutré

Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many celebrated approximation algorithms, commonly adopted in industrial practice for large scale-search and learning. The resource bottleneck of the…

Data Structures and Algorithms · Computer Science 2016-02-29 Anshumali Shrivastava

The ever-growing volume and decentralized nature of data, coupled with the need to harness it and extract knowledge, have led to the extensive use of distributed deep learning (DDL) techniques for training. These techniques rely on local…

Machine Learning · Computer Science 2024-11-22 Michail Theologitis , Georgios Frangias , Georgios Anestis , Vasilis Samoladas , Antonios Deligiannakis

Despite many modern applications of Deep Neural Networks (DNNs), the large number of parameters in the hidden layers makes them unattractive for deployment on devices with storage capacity constraints. In this paper we propose a Data-Driven…

Machine Learning · Computer Science 2021-07-14 Dimitris Papadimitriou , Swayambhoo Jain

The data heterogeneity across devices and the limited communication resources, e.g., bandwidth and energy, are two of the main bottlenecks for wireless federated learning (FL). To tackle these challenges, we first devise a novel FL…

Machine Learning · Computer Science 2023-02-21 Zhixiong Chen , Wenqiang Yi , Arumugam Nallanathan , Geoffrey Ye Li

SDE-based methods such as denoising diffusion probabilistic models (DDPMs) have shown remarkable success in real-world sample generation tasks. Prior analyses of DDPMs have been focused on the exponential Euler discretization, showing…

Machine Learning · Computer Science 2025-11-10 Matthew S. Zhang , Stephen Huan , Jerry Huang , Nicholas M. Boffi , Sitan Chen , Sinho Chewi

We investigate hyper-minimization for deterministic register automata (DRAs). We begin by introducing DRA counterparts of classical notions from deterministic finite automata. Building on these foundations, we present an algorithm for…

Formal Languages and Automata Theory · Computer Science 2026-05-06 Yong Li , Qiyi Tang , Di-De Yen

Big data, encompassing extensive datasets, has seen rapid expansion, notably with a considerable portion being textual data, including strings and texts. Simple compression methods and standard data structures prove inadequate for…

Data Structures and Algorithms · Computer Science 2024-11-11 Takaaki Nishimoto , Yasuo Tabei

Federated learning (FL) has gained a lot of attention in recent years for building privacy-preserving collaborative learning systems. However, FL algorithms for constrained machine learning problems are still limited, particularly when the…

Machine Learning · Computer Science 2024-08-20 Ali Dadras , Sourasekhar Banerjee , Karthik Prakhya , Alp Yurtsever

The bidirectional Fano algorithm (BFA) can achieve at least two times decoding throughput compared to the conventional unidirectional Fano algorithm (UFA). In this paper, bidirectional Fano decoding is examined from the queuing theory…

Information Theory · Computer Science 2010-11-12 Ran Xu , Graeme Woodward , Kevin Morris , Taskin Kocak

Data compression is a well-studied (and well-solved) problem in the setup of long coding blocks. But important emerging applications need to compress data to memory words of small fixed widths. This new setup is the subject of this paper.…

Information Theory · Computer Science 2017-01-12 Ori Rottenstreich , Yuval Cassuto

Standard resampling ratios (e.g., $\alpha \approx 0.632$) are widely used as default baselines in ensemble learning for three decades. However, how these ratios interact with a base learner's intrinsic functional complexity in finite…

Machine Learning · Computer Science 2026-04-14 Ye Su , Mingrui Ye , Yining Wang , Jipeng Guo , Yong Liu

Fault detection in Wireless Sensor Networks (WSNs) is crucial for reliable data transmission and network longevity. Traditional fault detection methods often struggle with optimizing deep neural networks (DNNs) for efficient performance,…

Artificial Intelligence · Computer Science 2025-05-13 Mahmood Mohassel Feghhi , Raya Majid Alsharfa , Majid Hameed Majeed