Related papers: Reachability in Vector Addition System with States…

Although Bayesian methods are robust and principled, their application in practice could be limited since they typically rely on computationally intensive Markov Chain Monte Carlo algorithms for their implementation. One possible solution…

Although shape correspondence is a central problem in geometry processing, most methods for this task apply only to two-dimensional surfaces. The neglected task of volumetric correspondence--a natural extension relevant to shapes extracted…

We apply geometric phase ideas to coherent states to shed light on interference phenomenon in the phase space description of continuous variable Cartesian quantum systems. In contrast to Young's interference characterized by path lengths,…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose…

The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions,…

We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a vector addition system with one zero-test. This algorithm…

This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by $\bar{EDS}$) and the vertex packing problem (denoted by $\bar{DS} $) are linear programming…

Visual localization occupies an important position in many areas such as Augmented Reality, robotics and 3D reconstruction. The state-of-the-art visual localization methods perform pose estimation using geometry based solver within the…

In this paper, we present a new approach of creating PTAS to the TSP problems by defining a bounded-curvature surface embedded spaces. Using this definition we prove: - A bounded-curvature surface embedded spaces TSP admits to a PTAS. -…

We study a generalization of the knapsack problem with geometric and vector constraints. The input is a set of rectangular items, each with an associated profit and $d$ nonnegative weights ($d$-dimensional vector), and a square knapsack.…

Let $G=(V,E)$ be a graph. A $k$-neighborhood in $G$ is a set of vertices consisting of all the vertices at distance at most $k$ from some vertex of $G$. The hypergraph on vertex set $V$ which edge set consists of all the $k$-neighborhoods…

Complex network topologies and hyperbolic geometry seem specularly connected, and one of the most fascinating and challenging problems of recent complex network theory is to map a given network to its hyperbolic space. The Popularity…

Hanika, Schneider, and Stumme introduced geometric data set as a generalization of metric measure space for the computation of the observable diameter, and extended the observable distance between metric measure spaces to that between…

While two-dimensional symmetry-enriched topological phases ($\mathsf{SET}$s) have been studied intensively and systematically, three-dimensional ones are still open issues. We propose an algorithmic approach of imposing global symmetry…

An explicit parameterization is given for the density matrices for $n$-state systems. The geometry of the space of pure and mixed states and the entropy of the $n$-state system is discussed. Geometric phases can arise in only specific…

In this paper a model reduction technique is introduced for piecewise-smooth (PWS) vector fields, whose trajectories fall into a Banach space, but the domain of definition of the vector fields is a non-dense subset of the Banach space. The…

Parametric timed automata (PTA) are an extension of timed automata in which clocks can be compared against parameters. The reachability problem asks for the existence of an assignment of the parameters to the non-negative integers such that…

Autonomous systems are increasingly implemented using end-to-end learning-based controllers. Such controllers make decisions that are executed on the real system, with images as one of the primary sensing modalities. Deep neural networks…

In this paper, we develop a novel method for fast geodesic distance queries. The key idea is to embed the mesh into a high-dimensional space, such that the Euclidean distance in the high-dimensional space can induce the geodesic distance in…