Related papers: Threefold Post Correspondence System
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…
A significant remaining challenge for existing recommender systems is that users may not trust the recommender systems for either lack of explanation or inaccurate recommendation results. Thus, it becomes critical to embrace a trustworthy…
We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…
We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…
We discuss critical elliptic systems in potential form. We prove existence, multiplicity, and compactness of solutions.
In this paper, a model (called the elliptic model) is proposed to estimate the number of social ties between two locations using population data in a similar manner to how transportation research deals with trips. To overcome the asymmetry…
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which…
We discuss the possibility of making the {\it initial} definitions of mutually different (possibly interacting, or even entangled) systems in the context of decoherence theory. We point out relativity of the concept of elementary physical…
Estimating the 6-DoF pose of a rigid object from a single RGB image is a crucial yet challenging task. Recent studies have shown the great potential of dense correspondence-based solutions, yet improvements are still needed to reach…
We consider \emph{plurality consensus} in a network of $n$ nodes. Initially, each node has one of $k$ opinions. The nodes execute a (randomized) distributed protocol to agree on the plurality opinion (the opinion initially supported by the…
The three-point correlation function (3PCF) of a weak lensing shear field contains information that is complementary to that in the two-point correlation function (2PCF), which can help improve the cosmological parameters and calibrate…
The ability to find correspondences in visual data is the essence of most computer vision tasks. But what are the right correspondences? The task of visual correspondence is well defined for two different images of same object instance. In…
Consider three qubits A, B, and C which may be entangled with each other. We show that there is a trade-off between A's entanglement with B and its entanglement with C. This relation is expressed in terms of a measure of entanglement called…
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a transition system. It is shown that some basic results of…
In this paper, we discuss a stochastic decision problem of optimally selecting the order in which to try $n$ opportunities that may yield an uncertain reward in the future. The motivation came out from pure curiosity, after an informal…
We consider two variations of the classical secretary problem. * A variation of the returning secretary problem where each interviewee may appear a second time with a fixed probability p. The decision-maker observes interviewees…
Cyber-physical systems (CPSs) facilitate the integration of physical entities and cyber infrastructures through the utilization of pervasive computational resources and communication units, leading to improved efficiency, automation, and…
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about uncertainty and multi-agent systems. When the set of agents and the set…
It was noticed by Harel in [Har86] that "one can define $\Sigma_1^1$-complete versions of the well-known Post Correspondence Problem". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a…
In this paper we initiate an approach that deals with the problem of calculating average properties of messages traveling on networks, by employing concepts and methods that are used for the study of the many-body problem in the field of…