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 ...
We discuss walking behavior in gauge theories and weak first-order phase transitions in statistical physics. Despite appearing in very different systems (QCD below the conformal window, the Potts model, deconfined criticality) these two phenomena both impl ...
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 ...
Visual backward masking is strongly deteriorated in patients with schizophrenia. Masking deficits are associated with strongly reduced amplitudes of the global field power in the EEG. Healthy participants who scored high in cognitive disorganization (a sch ...
We derive algorithms for efficient secure numerical and logical operations in the semi-honest model ensuring statistical or perfect security for secure multi-party computation (MPC). To derive our algorithms for trigonometric functions, we use basic mathem ...
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 ...
Consider the following property of a topological group G: every continuous affine G-action on a Hilbert space with a bounded orbit has a fixed point. We prove that this property characterizes amenability for locally compact a-compact groups (e.g., countabl ...
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 ...
