Related papers: Algorithms for weighted multi-tape automata
The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…
High precision calculations in perturbative QFT often require evaluation of big collection of Feynman integrals. Complexity of this task can be greatly reduced via the usage of linear identities among Feynman integrals. Based on…
In this paper, we look into the problem of channel assignment in multi-channel multi-radio wireless mesh networks. We propose a new learning automata based channel assignment scheme that adaptively improve network overall throughput by…
In this paper, we consider hybrid beamforming designs for multiuser massive multiple-input multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) systems. Aiming at maximizing the weighted spectral efficiency, we propose…
An algorithm that performs joint equalization and decoding for nonlinear two-dimensional intersymbol interference channels is presented. The algorithm performs sum-product message-passing on a factor graph that represents the underlying…
This paper proposes using file system custom metadata as a bidirectional communication channel between applications and the storage system. This channel can be used to pass hints that enable cross-layer optimizations, an option hindered…
The problem DFA-Intersection-Nonemptiness asks if a given number of deterministic automata accept a common word. In general, this problem is PSPACE-complete. Here, we investigate this problem for the subclasses of commutative automata and…
This paper proposes a parallel optimization algorithm for cooperative automation of large-scale connected vehicles. The task of cooperative automation is formulated as a centralized optimization problem taking the whole decision space of…
In this paper, we propose a distributed coordinated constrained task execution (C2TE) algorithm that enables a team of vehicles from different lanes to cooperatively merge into an {\it ordering-flexible platoon} maneuvering on the desired…
Many graph algorithms can be viewed as sets of rules that are iteratively applied, with the number of iterations dependent on the size and complexity of the input graph. Existing machine learning architectures often struggle to represent…
With the emergence of large model-based agents, widely adopted transformer-based architectures inevitably produce excessively long token embeddings for transmission, which may result in high bandwidth overhead, increased power consumption…
Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by…
In Terminal Monitoring Set (TMS), the input is an undirected graph $G=(V,E)$, together with a collection $T$ of terminal pairs and the goal is to find a subset $S$ of minimum size that hits a shortest path between every pair of terminals.…
Weighted finite-state automata (WSFAs) are commonly used in NLP. Failure transitions are a useful extension for compactly representing backoffs or interpolation in $n$-gram models and CRFs, which are special cases of WFSAs. The pathsum in…
The main challenge of massive machine-type communications (mMTC) is the joint activity and signal detection of devices. The mMTC scenario with many devices transmitting data intermittently at low data rates and via very short packets…
This paper is a quantitative analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for…
The multiple Try Metropolis (MTM) algorithm is an advanced MCMC technique based on drawing and testing several candidates at each iteration of the algorithm. One of them is selected according to certain weights and then it is tested…
This paper extends the matrix based approach to the setting of multiple subdivision schemes studied in [Sauer 2012]. Multiple subdivision schemes, in contrast to stationary and non-stationary schemes, allow for level dependent subdivision…
In this paper, we develop a functional weighted minimum mean-squared error (WMMSE) algorithm for downlink beamforming in multiuser continuous aperture array (CAPA) systems where both the base station (BS) and users are equipped with CAPAs.…
For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…