Results 11 to 20 of about 206,312 (263)
Discrete Applied Mathematics, 2022 The study of structural graph width parameters like tree-width, clique-width and rank-width has been ongoing during the last five decades, and their algorithmic use has also been increasing [Cygan et al., 2015]. New width parameters continue to be defined, for example, MIM-width in 2012, twin-width in 2020, and mixed-thinness, a generalization of ...
Flavia Bonomo-Braberman +3 more
openaire +3 more sources
On the thinness and proper thinness of a graph [PDF]
Discrete Applied Mathematics, 2019 Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval graphs. We study the complexity of problems related to the computation of these parameters, describe the behavior of the thinness ...
Flavia Bonomo, Diego de Estrada
openaire +3 more sources
Thinning, Entropy, and the Law of Thin Numbers [PDF]
IEEE Transactions on Information Theory, 2010 Renyi's "thinning" operation on a discrete random variable is a natural discrete analog of the scaling operation for continuous random variables. The properties of thinning are investigated in an information-theoretic context, especially in connection with information-theoretic inequalities related to Poisson approximation results.
Peter Harremoës +2 more
openaire +2 more sources
Vectorization in graphics recognition: to thin or not to thin [PDF]
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002 Vectorization, i.e. raster-to-vector conversion, is a central part of graphics recognition problems. In this paper, we discuss the pros and the cons of basing one's vectorization process on skeletonization. While distance skeletons have proven to be robust and precise, they tend to distort the results at line extremities and junctions.
Tombre, Karl, Tabbone, Salvatore
openaire +2 more sources
From thin objects to thin concepts?
Theoria, 2023 AbstractIn this short paper we consider Linnebo's thin/thick dichotomy: first, we show that it does not overlap with the very common one between abstract/concrete objects; second, on the basis of some difficulties with the distinction, we propose, as a possible way out, to move from thin/thick objects to thin/thick concepts.
Massimiliano Carrara +2 more
openaire +5 more sources
A Contour Approach to Thinning Algorithms
Communications, 2009 Thinning algorithms are widely used in many image processing tasks. Many thinning algorithms were proposed but they usually tend to process all image pixels in every iteration. Two approaches to contour thinning are described and a short discussion about
Peter Tarabek
doaj +1 more source
Notre Dame Journal of Formal Logic, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oleksandr Petrenko, I. V. Protasov
openaire +2 more sources
Applied Sciences, 2017 A three-dimensional (3D) skeletonization algorithm extracts the skeleton of a 3D model and provides it for many applications, such as 3D model classification and identification.
Xun Jin, Jongweon Kim
doaj +1 more source
Empirical modelling of chestnut coppice yield for Cimini and Vicani mountains (Central Italy)
Annals of Silvicultural Research, 2013 The prescription of stand rotation according to site conditions and economic targets requires yield information that expresses stand productivity under different site-classes.
Alice Angelini +4 more
doaj +1 more source
Integers, 2018 See the abstract in the attached pdf.
Melissa A. Huggan, Richard J. Nowakowski
openaire +4 more sources