Related papers: Marking and re-marking
Human perception is structured around objects which form the basis for our higher-level cognition and impressive systematic generalization abilities. Yet most work on representation learning focuses on feature learning without even…
We analyze different re-ranking algorithms for diversification and show that majority of them are based on maximizing submodular/modular functions from the class of parameterized concave/linear over modular functions. We study the…
Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…
On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…
We introduce poly-Bernoulli polynomials in two variables by using a generalization of Stirling numbers of the second kind that we studied in a previous work. We prove the bi-variate poly-Bernoulli polynomial version of some known results on…
While many image colorization algorithms have recently shown the capability of producing plausible color versions from gray-scale photographs, they still suffer from limited semantic understanding. To address this shortcoming, we propose to…
The last decade has seen a revolution in the theory and application of machine learning and pattern recognition. Through these advancements, variable ranking has emerged as an active and growing research area and it is now beginning to be…
In this paper, we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints. We obtain some new results relevant to this…
We review recent results that lead to a very precise understanding of the dynamics of typical unimodal maps from the statistical point of view. We also describe the (generalized) renormalization approach to the study of the statistical…
Based on an idea in [4] we propose a new iterative multiplicative filtering algorithm for label assignment matrices which can be used for the supervised partitioning of data. Starting with a row-normalized matrix containing the averaged…
Spectral rendering is essential for the production of physically-plausible synthetic images, but requires to introduce several changes in the content generation pipeline. In particular, the authoring of spectral material properties (e.g.,…
Granular convergence is a property of a granular pack as it is repeatedly sheared in a cyclic, quasistatic fashion, as the packing configuration changes via discrete events. Under suitable conditions the set of microscopic configurations…
The binomial multichannel algorithm is proposed. Some its properties are discussed.
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
Multilabel classification is a relatively recent subfield of machine learning. Unlike to the classical approach, where instances are labeled with only one category, in multilabel classification, an arbitrary number of categories is chosen…
Thinning is the removal of contour pixels/points of connected components in an image to produce their skeleton with retained connectivity and structural properties. The output requirements of a thinning procedure often vary with…
Within classical optics, one may add microscopic "roughness" to a macroscopically flat mirror so that parallel rays of a given angle are reflected at different outgoing angles. Taking the limit (as the roughness becomes increasingly…
We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.
In this paper, we consider a weighted generalization of the chromatic number of a Binomial random graph~\(G.\) We equip each edge with a random weight and then colour the vertices in such a way that the absolute colour difference between…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…