相关论文: Indistinguishable sceneries on the Boolean hypercu…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

In the present work we consider the problem of a reconstruction of eigenfunctions of the Johnson graph $J(n,w)$. We give necessary and sufficient numerical conditions for a unique reconstruction of an eigenfunction with given eigenvalue by…

This paper investigates a fully unsupervised statistical method for edge preserving image restoration and compression using a spatial decomposition scheme. Smoothed maximum likelihood is used for local estimation of edge pixels from mixture…

Reconstructing a surface from a point cloud is an underdetermined problem. We use a neural network to study and quantify this reconstruction uncertainty under a Poisson smoothness prior. Our algorithm addresses the main limitations of…

The ratio Z_1/Z_3 of vertex and wave-function renormalization factors, which is universal (i.e., matter-independent), is shown to equal 1+u which gives the residue of the scalar pole $\propto p_\mu p_\nu /p^2$ of 2-point function < D_\mu c…

Sixth-order boundary value problems (BVPs) arise in thin-film flows with a surface that has elastic bending resistance. To solve such problems, we first derive a complete set of odd and even orthonormal eigenfunctions -- resembling…

The core problem in multi-view anomaly detection is to represent local neighborhoods of normal instances consistently across all views. Recent approaches consider a representation of local neighborhood in each view independently, and then…

We analyze the computational complexity of the following computational problems called Bounded-Density Edge Deletion and Bounded-Density Vertex Deletion: Given a graph $G$, a budget $k$ and a target density $\tau_\rho$, are there $k$ edges…

Outdoor scene relighting is a challenging problem that requires good understanding of the scene geometry, illumination and albedo. Current techniques are completely supervised, requiring high quality synthetic renderings to train a…

We study the scenery reconstruction problem on the $d$-dimensional torus, proving that a criterion on Fourier coefficients obtained by Matzinger and Lember (2006) for discrete cycles applies also in continuous spaces. In particular, with…

Consider the following random process: The vertices of a binomial random graph $G_{n,p}$ are revealed one by one, and at each step only the edges induced by the already revealed vertices are visible. Our goal is to assign to each vertex one…

Interfacial reconstruction between two-dimensional (2D) materials and metal substrates fundamentally governs heterostructure properties, yet conventional flat substrates fail to capture the continuous crystallographic landscape. Here, we…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

The reconstruction of object surfaces from multi-view images or monocular video is a fundamental issue in computer vision. However, much of the recent research concentrates on reconstructing geometry through implicit or explicit methods. In…

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz…

We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $\Delta(G) + 1$ colors. We deduce this from a stronger result, namely that an $n$-vertex (finite) graph $G$ of subexponential growth can be…

Breuer and Klivans defined a diverse class of scheduling problems in terms of Boolean formulas with atomic clauses that are inequalities. We consider what we call graph-like scheduling problems. These are Boolean formulas that are…

In this study, a novel illuminant color estimation framework is proposed for computational color constancy, which incorporates the high representational capacity of deep-learning-based models and the great interpretability of…

We give an explicit family of polynomial maps called center unstable H\'enon-like maps and prove that they exhibits blenders for some parametervalues. Using this family, we also prove the occurrence of blenders near certain non-transverse…