English
Related papers

Related papers: Shape Preserving Tree Transducers

200 papers

Call a string-to-string transducer regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. This paper proposes to…

Formal Languages and Automata Theory · Computer Science 2013-09-25 Mikołaj Bojańczyk

While convolutional neural networks have shown a tremendous impact on various computer vision tasks, they generally demonstrate limitations in explicitly modeling long-range dependencies due to the intrinsic locality of the convolution…

Computer Vision and Pattern Recognition · Computer Science 2021-08-06 Guanglei Yang , Hao Tang , Mingli Ding , Nicu Sebe , Elisa Ricci

Attributed tree transducers (atts) have been equipped with regular look-around (i.e., a preprocessing via an attributed relabeling) in order to obtain a more robust class of translations. Here we give further evidence of this robustness: we…

Formal Languages and Automata Theory · Computer Science 2024-06-12 Sebastian Maneth , Martin Vu

This work concerns formal descriptions of DNA code properties, and builds on previous work on transducer descriptions of classic code properties and on trajectory descriptions of DNA code properties. This line of research allows us to give…

Formal Languages and Automata Theory · Computer Science 2015-03-03 Lila Kari , Stavros Konstantinidis , Steffen Kopecki

We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases. Our main…

Combinatorics · Mathematics 2020-06-25 Elismar R. Oliveira , Victor N. Schvöllner , Vilmar Trevisan

The rules in a shape grammar apply in terms of embedding to take advantage of the parts that emerge visually in the appearance of shapes. While the shapes are kept unanalyzed as a computation moves forward, part-structures for shapes can be…

Formal Languages and Automata Theory · Computer Science 2022-03-15 Alexandros Haridis , George Stiny

One of the main challenges of Topological Data Analysis (TDA) is to extract features from persistent diagrams directly usable by machine learning algorithms. Indeed, persistence diagrams are intrinsically (multi-)sets of points in…

Machine Learning · Computer Science 2022-09-27 Raphael Reinauer , Matteo Caorsi , Nicolas Berkouk

We cast shape matching as metric learning with convolutional networks. We break the end-to-end process of image representation into two parts. Firstly, well established efficient methods are chosen to turn the images into edge maps.…

Computer Vision and Pattern Recognition · Computer Science 2018-07-27 Filip Radenović , Giorgos Tolias , Ondřej Chum

Expanders are powerful algorithmic structures with two key properties: they are a) routable: for any multi-commodity flow unit demand, there exists a routing with low congestion over short paths, where a demand is unit if the amount of…

Data Structures and Algorithms · Computer Science 2025-07-18 Bernhard Haeupler , Antti Roeyskoe

The goal of this paper is to advance the development of wave-guiding subwavelength crystals by developing designs whose properties are stable with respect to imperfections in their construction. In particular, we make use of a locally…

Analysis of PDEs · Mathematics 2021-01-07 Habib Ammari , Bryn Davies , Erik Orvehed Hiltunen , Sanghyeon Yu

A topological argument is presented for nodal structures of superconducting states with time-reversal invariance. A generic Hamiltonian which describes a quasiparticle in superconducting states with time-reversal invariance is derived, and…

Superconductivity · Physics 2007-05-23 Masatoshi Sato

Transformer models underpin many recent advances in practical machine learning applications, yet understanding their internal behavior continues to elude researchers. Given the size and complexity of these models, forming a comprehensive…

We present a novel resizing module for neural networks: shape adaptor, a drop-in enhancement built on top of traditional resizing layers, such as pooling, bilinear sampling, and strided convolution. Whilst traditional resizing layers have…

Machine Learning · Computer Science 2020-08-11 Shikun Liu , Zhe Lin , Yilin Wang , Jianming Zhang , Federico Perazzi , Edward Johns

It will be shown that according to theorems of K. Menger, every neuron grid if identified with a curve is able to preserve the adopted qualitative structure of a data space. Furthermore, if this identification is made, the neuron grid…

Neural and Evolutionary Computing · Computer Science 2018-02-02 Dietmar Volz

We introduce a method that can be used to evolve the topology of a network in a way that preserves both the network's spectral as well as local structure. This method is quite versatile in the sense that it can be used to evolve a network's…

Adaptation and Self-Organizing Systems · Physics 2016-08-23 Leonid Bunimovich , Benjamin Webb

We discuss an autoencoder model in which the encoding and decoding functions are implemented by decision trees. We use the soft decision tree where internal nodes realize soft multivariate splits given by a gating function and the overall…

Machine Learning · Computer Science 2014-09-29 Ozan İrsoy , Ethem Alpaydın

The dynamics of network formation are generally very complex, making the study of distributions over the space of networks often intractable. Under a condition called conservativeness, I show that the stationary distribution of a network…

Theoretical Economics · Economics 2025-04-15 Jose M. Betancourt

Deterministic two-way transducers with pebbles (aka pebble transducers) capture the class of polyregular functions, which extend the string-to-string regular functions allowing polynomial growth instead of linear growth. One of the most…

Formal Languages and Automata Theory · Computer Science 2025-06-16 Luc Dartois , Paul Gastin , L. Germerie Guizouarn , Shankaranarayanan Krishna

A general class of unidirectional transforms is presented that can be computed in a distributed manner along an arbitrary routing tree. Additionally, we provide a set of conditions under which these transforms are invertible. These…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-05-14 Godwin Shen , Antonio Ortega

In this paper, we extend the structure-preserving interpolatory model reduction framework, originally developed for linear systems, to structured bilinear control systems. Specifically, we give explicit construction formulae for the model…

Numerical Analysis · Mathematics 2021-05-17 Peter Benner , Serkan Gugercin , Steffen W. R. Werner