Related papers: From axial C-hedra to general P-nets
We present three multi-scale similarity learning architectures, or DeepSim networks. These models learn pixel-level matching with a contrastive loss and are agnostic to the geometry of the considered scene. We establish a middle ground…
Sparse Neural Networks regained attention due to their potential for mathematical and computational advantages. We give motivation to study Artificial Neural Networks (ANNs) from a network science perspective, provide a technique to embed…
When performing data classification over a stream of continuously occurring instances, a key challenge is to develop an open-world classifier that anticipates instances from an unknown class. Studies addressing this problem, typically…
We generalize the Chern class relation for the transversal intersection of two nonsingular varieties to a relation for possibly singular varieties, under a 'splayedness' assumption. The relation is shown to hold for both the…
We present a deep layered architecture that generalizes classical convolutional neural networks (ConvNets). The architecture, called SimNets, is driven by two operators, one being a similarity function whose family contains the convolution…
In the simplicial theory of hypercoverings, we replace the indexing category $\Delta$ by the \emph{symmetric simplicial category} $\Delta S$ and study (a class of) $\Delta S$-hypercoverings, which we call \emph{spaces admitting symmetric…
Recently, dense connections have attracted substantial attention in computer vision because they facilitate gradient flow and implicit deep supervision during training. Particularly, DenseNet, which connects each layer to every other layer…
As a fundamental building block in computer vision, edges can be categorised into four types according to the discontinuity in surface-Reflectance, Illumination, surface-Normal or Depth. While great progress has been made in detecting…
A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus,…
In this paper we prove that various quasi-categories whose objects are $\infty$-categories in a very general sense are complete: admitting limits indexed by all simplicial sets. This result and others of a similar flavor follow from a…
Partial cubes are graphs isometrically embeddable into hypercubes. In this paper it is proved that every cubic, vertex-transitive partial cube is isomorphic to one of the following graphs: $K_2 \, \square \, C_{2n}$, for some $n\geq 2$, the…
Let $C$ be a smooth curve of genus $g \geq 1$ and let $C^{(2)}$ be its second symmetric product. In this note we prove that if $C$ is very general, then the blow-up of $C^{(2)}$ at a very general point has non-polyhedral pseudo-effective…
Various architectures (such as GoogLeNets, ResNets, and DenseNets) have been proposed. However, the existing networks usually suffer from either redundancy of convolutional layers or insufficient utilization of parameters. To handle these…
We propose a statistical model for graphs with a core-periphery structure. To do this we define a precise notion of what it means for a graph to have this structure, based on the sparsity properties of the subgraphs of core and periphery…
Topology and geometry are deeply intertwined in the study of surfaces, though their interaction manifests differently in smooth and discrete settings. In the smooth category, a classical result asserts that any closed smooth surface…
We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random…
Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…
The class-agnostic counting (CAC) problem has caught increasing attention recently due to its wide societal applications and arduous challenges. To count objects of different categories, existing approaches rely on user-provided exemplars,…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
We introduce here Cartesian splines or, for short, C-splines. C- splines are piecewise polynomials which are defined on adjacent Cartesian coordinate systems and are Cr continuous throughout. The Cr continuity is enforced by constraining…