Telecomunicaciones, información y comunicación

List Defective Colorings: Distributed Algorithms and Applications

- The distributed coloring problem is at the core of the area of distributed graph algorithms and it is a problem that has seen tremendous progress over the last few years. Much of the remarkable...

A Survey on Design Methodologies for Accelerating Deep Learning on Heterogeneous Architectures

- Given their increasing size and complexity, the need for efficient execution of deep neural networks has become increasingly pressing in the design of heterogeneous High-Performance Computing (HPC)...

Representing Random Utility Choice Models with Neural Networks

- Motivated by the successes of deep learning, we propose a class of neural network-based discrete choice models, called RUMnets, inspired by the random utility maximization (RUM) framework. This model...

Efficient Monitoring of Timed Properties

- In this paper we study monitoring of real-time systems with respect to properties given by a pair of Timed Büchi Automata, one for the property and one for its complement. This includes properties...

Psychological Determinants and Consequences of Complex Networks

- This paper presents two models that exemplify psychological factors as a determinant and as a consequence of social network characteristics. There is an endogeneity considered in network formation:...

Modeling Long-Term Memory and Temporal Attention Shifts for Video Salient Object Ranking with a New Benchmark

- Salient Object Ranking (SOR) aims to estimate the relative saliency order among multiple salient objects. While SOR has been extensively studied in static images, Video Salient Object Ranking (VSOR)...

Optimal rounding under integer constraints

- Given $N$ real numbers whose sum is an integer, we study the problem of finding $N$ integers that preserve the sum while minimizing the rounding error. We first show that every optimal solution...

Real-time decoding of quantum error correction codes using high-performance computing

- Quantum error correction (QEC) is indispensable for building scalable fault-tolerant quantum computers. Effective QEC demands stringent real-time decoding: the decoder must process syndrome...

Separating quantum circuits from classical LLMs

- Modern large language models - transformers and diffusion language models - are built around two canonical algorithmic tasks: prediction and generation. We prove unconditional separations between...

Information-Geometric Forward Policy Training in GFlowNets

- Generative Flow Networks (GFlowNets) have emerged as a flexible framework for amortised inference over discrete and mixed discrete-continuous objects, requiring only an unnormalised target density...

Robust Low-Tubal-Rank Tensor Completion under Cross-Concentrated Sampling

- Tensor cross-concentrated sampling (t-CCS) bridges entrywise sampling and t-CUR slice-wise sampling by observing entries only within selected horizontal and lateral slices. Existing t-CCS completion...

CNOT-Distance is NP-complete under all-to-all connectivity

- Given $A\in\operatorname{GL}(N,2)$ and an integer $K$, we ask whether $A$ can be implemented by at most $K$ CNOT gates on fixed labelled wires with all-to-all connectivity. We prove that this problem...

High-level quantum structured programs as quantum registers compositions

- Current quantum programs are mainly designed at the level of quantum gates acting on individual qubits; on a large scale and for complex problems this may involve a high cognitive load on the...

Fidelity-Based Robustness Margins for Finite-Time Quantum Control

- We develop a structure-specific fidelity-threshold robustness margin for finite-dimensional closed quantum systems under piecewise-constant coherent control. A scalar physical parameter may perturb...

A 3-D Hybrid Numerical Method for Simulating Electromagnetic Fields in Structures with Multiple Inhomogeneous Layered Media

- A three-dimensional (3-D) hybrid numerical method (HNM) is presented for electromagnetic scattering in structures with multiple inhomogeneous layered media coupled to an arbitrary 3-D non-layered...

Expected cost in Combinatorial Optimization under color constraints

- We present an average case model of classical problems in combinatorial optimization where there are color constraints. In all cases we seek some (spanning) sub-structure of a complete graph of...

Divide-and-Conquer: Towards Generalizable Amortized Bayesian Inference for the Drift Diffusion Model

- The drift diffusion model (DDM) is a cornerstone of cognitive decision-making research. Although numerous estimation methods exist, researchers continue to seek inference approaches that are both...

A proximal difference of convex functions algorithm using Barzilai-Borwein step size with nonmonotone line search and extrapolation

- The paper proposes a novel proximal difference-of-convex (DC) algorithmic framework to solve general non-convex, non-smooth optimization problems. By combining Barzilai-Borwein (BB) step sizes with...

Task-Oriented Candidate-Latent Feedback for Coarse-to-Fine Sensing in Distributed OFDM-ISAC Networks

- Future integrated sensing and communication (ISAC) architectures separate the sensing entity (SE) that acquires measurements from the sensing function (SF) that performs inference, creating a need...

Dynamic Proximal Point Method for Unconstrained Minimization

- In this work, we present a novel dynamic proximal point algorithm for unconstrained optimization. The method generates a sequence of proximal subproblems, where the quadratic regularization term is...

A Direct Route to Markov Chain Convergence via Asymptotic Equivalence with the Target

- For a Markov kernel $T$ with an invariant probability measure $\pi$, we give a self-contained proof of the Markov chain convergence theorem via a criterion called asymptotic equivalence with the...