Related papers: Algorithms generating images of attractors of gene…
We investigate classical and quantum physics-based algorithms for solving the graph isomorphism problem. Our work integrates and extends previous work by Gudkov et al. (cond-mat/0209112) and by Rudolph (quant-ph/0206068). Gudkov et al.…
In this work we propose a definition of an Euroattractor: an attracting invariant measure of a certain iterated functions system (IFS). An IFS is defined by specifying a set of functions, defined in subsets of R^N or in a classical phase…
We develop a qualitative-dynamics framework for general Iterated Function Systems (IFSs) on locally compact spaces. Our approach extends to IFSs a framework recently developed in the semiflows setting by James Yorke and the present author…
In 1996, Strichartz introduced reverse iterated function systems (RIFS) $\mathcal{F}=\{f_i(x)=r_i x+b_i\}_{i=1}^m$ of expanding mappings on $\mathbb{Z}$ and left the determination of the general dimension formulas of invariant sets as an…
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm etc., which take too much computer time to compute all the…
Evolutionary search has been extensively used to generate artistic images. Raw images have high dimensionality which makes a direct search for an image challenging. In previous work this problem has been addressed by using compact symbolic…
Graph Interpolation Grammars are a declarative formalism with an operational semantics. Their goal is to emulate salient features of the human parser, and notably incrementality. The parsing process defined by GIGs incrementally builds a…
The task of scene graph generation entails identifying object entities and their corresponding interaction predicates in a given image (or video). Due to the combinatorially large solution space, existing approaches to scene graph…
Conditions are given which imply that analytic iterated function systems (IFS's) in the complex plane have uniformly perfect attractor sets. In particular, it is shown that the attractor set of a finitely generated conformal IFS is…
In the analysis of real-world data, extracting meaningful features from signals is a crucial task. This is particularly challenging when signals contain non-stationary frequency components. The Iterative Filtering (IF) method has proven to…
A finite family $\mathcal{F}=\{f_1,\ldots,f_n\}$ of continuous selfmaps of a given metric space $X$ is called an iterated function system (shortly IFS). In a case of contractive selfmaps of a complete metric space is well-known that IFS has…
Measures generated by Iterated Function Systems composed of uncountably many one--dimensional affine maps are studied. We present numerical techniques as well as rigorous results that establish whether these measures are absolutely or…
Generative adversarial nets (GANs) have become a preferred tool for tasks involving complicated distributions. To stabilise the training and reduce the mode collapse of GANs, one of their main variants employs the integral probability…
[...] In this thesis, we are interested in generalizing factor graphs and the relevant methods toward describing quantum systems. Two generalizations of classical graphical models are investigated, namely double-edge factor graphs (DeFGs)…
We present an algorithm to directly solve numerous image restoration problems (e.g., image deblurring, image dehazing, image deraining, etc.). These problems are highly ill-posed, and the common assumptions for existing methods are usually…
Neural networks are prone to catastrophic forgetting when trained incrementally on different tasks. Popular incremental learning methods mitigate such forgetting by retaining a subset of previously seen samples and replaying them during the…
We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation…
Flip processes, introduced in [Garbe, Hladk\'y, \v{S}ileikis, Skerman: From flip processes to dynamical systems on graphons], are a class of random graph processes defined using a rule which is just a function…
The increasing realism of generated images has raised significant concerns about their potential misuse, necessitating robust detection methods. Current approaches mainly rely on training binary classifiers, which depend heavily on the…
We investigate the topological and metric properties of attractors of an iterated function system (IFS) whose functions may not be contractive. We focus, in particular, on invertible IFSs of finitely many maps on a compact metric space. We…