Results 41 to 50 of about 477 (109)
Polyominoes determined by permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes,
I. Fanti +4 more
doaj +1 more source
Label-based parameters in increasing trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
doaj +1 more source
Conditioned Galton-Watson trees do not grow [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.
Svante Janson
doaj +1 more source
TIGRE v3: Efficient and easy to use iterative computed tomographic reconstruction toolbox for real datasets [PDF]
Engineering Research ExpressComputed Tomography (CT) has been widely adopted in medicine and it is increasingly being used in scientific and industrial applications. Parallelly, research in different mathematical areas concerning discrete inverse problems has led to the development
A. Biguri +13 more
semanticscholar +1 more source
Matching solid shapes in arbitrary dimension via random sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We give simple probabilistic algorithms that approximately maximize the volume of overlap of two solid, i.e. full-dimensional, shapes under translations and rigid motions. The shapes are subsets of $ℝ^d$ where $d≥ 2$.
Daria Schymura
doaj +1 more source
Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend +2 more
doaj +1 more source
Aberration correction in 2D echocardiography
Quantitative Imaging in Medicine and Surgery, 2023 Background An aberration correction algorithm has been implemented and demonstrated in an echocardiographic clinical trial using two-dimensional (2D) imaging.
S. Måsøy +9 more
semanticscholar +1 more source
Samples of geometric random variables with multiplicity constraints [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We investigate the probability that a sample $\Gamma=(\Gamma_1,\Gamma_2,\ldots,\Gamma_n)$ of independent, identically distributed random variables with a geometric distribution has no elements occurring exactly $j$ times, where $j$ belongs to a specified
Margaret Archibald, Arnold Knopfmacher
doaj +1 more source
Structure of Stable Sand Piles Model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this paper we study a variant of the Sand Piles Model, where the evolution rule consists of the falling down of one grain to a random column and an avalanche to reach a stable configuration.
Thi Ha Duong Phan, Thi Thu Huong Tran
doaj +1 more source
A study of why we need to reassess full reference image quality assessment with medical images [PDF]
Journal of imaging informatics in medicineImage quality assessment (IQA) is indispensable in clinical practice to ensure high standards, as well as in the development stage of machine learning algorithms that operate on medical images.
Anna Breger +13 more
semanticscholar +1 more source