Graph alignment in two correlated random graphs refers to the task of identifying the correspondence between vertex sets of the graphs. Recent results have characterized the exact information-theoretic threshold for graph alignment in correlated Erdös-Rény ...
This paper tackles the problem of novel view synthesis from a single image. In particular, we target real-world scenes with rich geometric structure, a challenging task due to the large appearance variations of such scenes and the lack of simple 3D models ...
The wide adoption of DNNs has given birth to unrelenting computing requirements, forcing datacenter operators to adopt domain-specific accelerators to train them. These accelerators typically employ densely packed full-precision floating-point arithmetic t ...
Localizing the source of an epidemic is a crucial task in many contexts, including the detection of malicious users in social networks and the identification of patient zeros of disease outbreaks. The difficulty of this task lies in the strict limitation ...
In dynamical systems, the full stability of fixed point solutions is determined by their basins of attraction. Characterizing the structure of these basins is, in general, a complicated task, especially in high dimensionality. Recent works have advocated t ...
A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...
We investigate how probability tools can be useful to study representations of non-amenable groups. A suitable notion of "probabilistic subgroup" is proposed for locally compact groups, and is valuable to induction of representations. Nonamenable groups ad ...
This paper presents a method to verify closed-loop properties of optimization-based controllers for deterministic and stochastic constrained polynomial discrete-time dynamical systems. The closed-loop properties amenable to the proposed technique include g ...
Every principal G-bundle over X is classified up to equivalence by a homotopy class X -> BG, where BG is the classifying space of G. On the other hand, for every nice topological space X Milnor constructed a strict model of its loop space (Omega) over tild ...
