Results 21 to 30 of about 39,779 (296)
Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can produce. We prove that up to a slight recoding, they correspond exactly to languages in the complexity classes $\nspace{n}$ and $\cne$.
Jeandel, Emmanuel, Vanier, Pascal
openaire +4 more sources
21 pages, 50 figures. Based on a Clay Public Lecture by the second author at the IAS/Park City Mathematics Institute in July, 2004.
Ardila, Federico, Stanley, Richard P.
openaire +4 more sources
Tiling is a well-known pattern mining technique. Traditionally, it discovers large areas of ones in binary databases or matrices, where an area is defined by a set of rows and a set of columns. In this paper, we introduce the novel problem of ranked tiling, which is concerned with finding interesting areas in ranked data. In this data, each transaction
Le Van, Thanh +5 more
openaire +4 more sources
Hard Tiling Problems with Simple Tiles [PDF]
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs.
Cristopher Moore, J. M. Robson
openaire +3 more sources
CART: Constant Aspect Ratio Tiling [PDF]
International audienceParametric tiling is a well-known transformation which is widely used to improve locality, parallelism and granularity. However, parametric tiling is also a non-linear transformation and this prevents polyhedral analysis or further ...
Rajopadhye, Sanjay +7 more
core +4 more sources
Given a list $1\times 1, 1\times a, 1\times b, \dots, 1\times c$ of rectangles, with $a,b,\dots,c$ non-negative, when can $1\times{t}$ be tiled by positive and negative copies of rectangles which are similar (uniform scaling) to those in the list? We prove that such a tiling exists iff $t$ is in the field $Q(a,b,\dots,c)$.
Kevin Keating, Jonathan L. King
openaire +2 more sources
Whilst Polyomino tiling theory has been extensively studied as a branch of research in mathematics, its application has been largely confined to multimedia, graphics and gaming domains.
Veerajagadheswar Prabakaran +4 more
doaj +1 more source
A Tiling-Theoretic Approach to Efficient Area Coverage in a Tetris-Inspired Floor Cleaning Robot
Although numerous studies have focused on the development and application of polyomino tiling theories, research of this nature is typically limited to the graphics and gaming fields.
Prabakaran Veerajagadheswar +3 more
doaj +1 more source
AbstractWe study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling withKolmogorov complexity of its (n×n)-squares. We construct tile sets for which this bound is tight: all (n×n)-squares in all tilings have complexity Ω(n).
Bruno Durand 0001 +2 more
openaire +6 more sources
Historical and comparative assessment of artistic and technical features of wooden doors of Khurasan Museum [PDF]
Among the wooden works of the Holy Shrine’s collection there have been doors That are transferred to the store of Cultural Heritage and Tourism Organization of Khorasan in the tomb of Ferdowsi with the implementation of the expansion of the shrine in the
alireza sheikhi +2 more
doaj +1 more source

