Related papers: Polynomial-time Algorithms for Computing Distances…
Many physical phenomena, including thermalization in open quantum systems and quantum Gibbs sampling, are modeled by Lindbladians approximating a system weakly coupled to a bath. Understanding the convergence speed of these Lindbladians to…
The recent large scale availability of mobility data, which captures individual mobility patterns, poses novel operational problems that are exciting and challenging. Motivated by this, we introduce and study a variant of the…
Exactly computing the full output distribution of linear optical circuits remains a challenge, as existing methods are either time-efficient but memory-intensive or memory-efficient but slow. Moreover, any realistic simulation must account…
Artificial intelligence algorithms have been extensively applied in the field of intelligent transportation, especially for driving behavior analysis and prediction. This study proposes a novel framework by integrating fuzzy trajectory…
Considering the high volume, wide variety, and rapid speed of data generation, investigating feature selection methods for big data presents various applications and advantages. By removing irrelevant and redundant features, feature…
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…
We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have guarantees of finding policies within a constant factor or a…
We describe computational tools that have been developed to simulate dynamical mass transfer in semi-detached, polytropic binaries that are initially executing synchronous rotation upon circular orbits. Initial equilibrium models are…
We argue that one can associate a pseudo-time with sequences of configurations generated in the course of classical Monte Carlo simulations for a single-minimum bound state, if the sampling is optimal. Hereby the sampling rates can be,…
We introduce an algorithm based on Generalized Dual Method (GDM) to efficiently study the dynamics of a particle in quasiperiodic environments without the need to use periodic approximations or to save the information of the vertices that…
The measures of distances between points in a Hilbert space are one of the basic theoretical concepts used to characterize properties of a quantum system with respect to some etalon state. These are not only used in studying fidelity of…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
Matching of binary image features is an important step in many different computer vision applications. Conventionally, an arbitrary threshold is used to identify a correct match from incorrect matches using Hamming distance which may…
We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a finite-range stable potential. This result holds for all activities $\lambda$ for which the…
We give a polynomial time algorithm for the lossy population recovery problem. In this problem, the goal is to approximately learn an unknown distribution on binary strings of length $n$ from lossy samples: for some parameter $\mu$ each…
In this paper a fuzzy clustering model for fuzzy data with outliers is proposed. The model is based on Wasserstein distance between interval valued data which is generalized to fuzzy data. In addition, Keller's approach is used to identify…
Multi-sensor state space models underpin fusion applications in networks of sensors. Estimation of latent parameters in these models has the potential to provide highly desirable capabilities such as network self-calibration. Conventional…
We push the limit in planning collision-free motions for routing uniform labeled discs in two dimensions. First, from a theoretical perspective, we show that the constant-factor time-optimal routing of labeled discs can be achieved using a…
In multi-parameter persistence, the matching distance is defined as the supremum of weighted bottleneck distances on the barcodes given by the restriction of persistence modules to lines with a positive slope. In the case of finitely…
We present the method of walk-sum to study the real-time dynamics of interacting quantum many-body systems. The walk-sum method generates explicit expressions for any desired pieces of an evolution operator U independently of any others.…