Filters








6,528 Hits in 2.8 sec

Preprocessing Ambiguous Imprecise Points

Ivor Van Der Hoog, Irina Kostitsyna, Maarten Löffler, Bettina Speckmann, Michael Wagner
2019 International Symposium on Computational Geometry  
ACM Subject Classification Theory of computation → Design and analysis of algorithms the regions: for each region we count only the overlap with regions that appear earlier in the permutation.  ...  We introduce the ambiguity A(R) as a more fine-grained measure of the degree of overlap in R.  ...  If we now substitute Equation (4) into this equation we get that the maximum is realized if λ = |X| which proves the lemma. Lemma 4.  ... 
doi:10.4230/lipics.socg.2019.42 dblp:conf/compgeom/HoogKLS19 fatcat:wgcoyvfydncrvhykoufl6baie4

A unified analysis of niche overlap incorporating data of different types

Shane W. Geange, Shirley Pledger, Kevin C. Burns, Jeffrey S. Shima
2010 Methods in Ecology and Evolution  
We then describe null model permutation tests that assess statistical differences in niche overlap, which can address questions commonly posed by population ecologists (e.g. do two species occupy different  ...  as the overlapping area between the distributions for each species. 4.  ...  constructed multivariate measures of mean niche overlap using equation 5 above.  ... 
doi:10.1111/j.2041-210x.2010.00070.x fatcat:adxdspbckna35ivkptszkf6thy

Pattern avoidance in binary trees

Eric S. Rowland
2010 Journal of combinatorial theory. Series A  
We provide an algorithm for computing the generating function that counts n-leaf binary trees avoiding a given binary tree pattern t.  ...  Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective n-leaf trees that avoid them are equinumerous.  ...  Most permutations are not viable. Candidate permutations can be found experimentally by simply testing all m!  ... 
doi:10.1016/j.jcta.2010.03.004 fatcat:xevgwqxe2fgdzb2fsd53qxiexi

Permutative rewriting and unification

Thierry Boy de la Tour, Mnacho Echenim
2007 Information and Computation  
Permutative rewriting provides a way of analyzing deduction modulo a theory defined by leaf-permutative equations.  ...  since E is leaf-permutative).  ...  Definition 3. 1 . 1 An equation is leaf-permutative if it has the form c ≈ c , where c is linear and is a permutation of Var(c). Fig. 1 . 1 The permutative rewriting relation t p c t .  ... 
doi:10.1016/j.ic.2006.11.001 fatcat:rv2u6ediurgwzm2otlxrs3offa

Non-Contiguous Pattern Avoidance in Binary Trees [article]

Michael Dairyko, Lara Pudwell, Samantha Tyner, Casey Wynn
2012 arXiv   pre-print
Finally, we explore connections between pattern-avoiding trees and pattern-avoiding permutations.  ...  This nice relationship between g c k (x) and g c k−1 (x) seems natural because of the large overlap between copies of c k and c k−1 .  ...  Thus, by induction and Equation 3 , the proposition follows. Equation 3 simplifies further for one particular family of binary tree patterns.  ... 
arXiv:1203.0795v2 fatcat:z3sywfnjmzhnjg37thhkryp5qm

Disentangling age- and disease-related alterations in schizophrenia brain network using structural equation modeling: A graph theoretical study based on minimum spanning tree

Xinyu Liu, Hang Yang, Benjamin Becker, Xiaoqi Huang, Cheng Luo, Chun Meng, Bharat Biswal
2021 Human Brain Mapping  
In this study, we aimed to use minimum spanning tree (MST) as an unbiased network reconstruction and employed structural equation modeling (SEM) to unravel intertwined relationships among multiple phenotypic  ...  The p value is set as the number of times that permuted within-group similarity is not less than the actual within-group overlap divided by 10,000 times of permutations in total.  ...  Each element is the value of overlapping rate between two subjects Permutation test further revealed that the actual within-group similarity was significantly higher than within-group similarity generated  ... 
doi:10.1002/hbm.25403 pmid:33960579 pmcid:PMC8193510 fatcat:gnvzt4s5a5fg3kdokjezlzoyzy

Operadic Gröbner Bases: An Implementation [chapter]

Vladimir Dotsenko, Mikael Vejdemo-Johansson
2010 Lecture Notes in Computer Science  
The composition maps are parametrized by arbitrary permutations in S m 1 +···+mn (resp. by shuffle permutations of type (m 1 , . . . , m n )) that provide symmetry actions to the operad.  ...  This final equation can be used as is for a data type declaration in Haskell.  ... 
doi:10.1007/978-3-642-15582-6_42 fatcat:mee653cn7zcmfdyipu25ayal7e

The Better Accuracy of Strassen-Winograd Algorithms (FastMMW)

Paolo D'Alberto
2014 Advances in Linear Algebra and Matrix Theory  
Marco Bodrato had the idea of permuting the computation among recursion calls. We revisited the permutation used by David Wise and checked the original use of the permutations.  ...  So instead of applying random permutations, we tried to understand which computation and permutation we could use systematically.  ...  partial overlap.  ... 
doi:10.4236/alamt.2014.41002 fatcat:xecwi3guffdonkff5uyhksrtdu

Average-Case Analysis of Perfect Sorting by Reversals [chapter]

Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin
2009 Lecture Notes in Computer Science  
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence  ...  Bérard et al. (2007) make use of strong interval trees to describe an algorithm for sorting signed permutations by reversals.  ...  If intervals I and J do not commute, they overlap.  ... 
doi:10.1007/978-3-642-02441-2_28 fatcat:rrkj5qxu5fhqzkmhq3jxxwklpq

Related plants tend to share pollinators and herbivores, but strength of phylogenetic signal varies among plant families

Alyssa R. Cirtwill, Giulio V. Dalla Riva, Nick J. Baker, Mikael Ohlsson, Isabelle Norström, Inger‐Marie Wohlfarth, Joshua A. Thia, Daniel B. Stouffer
2020 New Phytologist  
proportional and absolute overlap).  ...  Across all networks, more closely-related plants tended to have greater overlap.  ...  These equations took the same form as equation 2. Models for two families did not converge.  ... 
doi:10.1111/nph.16420 pmid:31917859 fatcat:wkcn3pbmwne6lghi2zshn4rigm

Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach

Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik
2006 ACM Transactions on Database Systems  
In particular, it has been shown that both the permutation and the merge-and-sort approaches can guarantee generation of an overlap-free partition if there exists one.  ...  If area(overlap(P )) = area(ES 1 .DM BR ∩ ES 2 .DM BR) = 0, P is said to be overlap-free.  ...  Note that the first case in (28) represents the situation when the d i dimensions of the DMBR have never been split yet so that Equation (24) can be applied.  ... 
doi:10.1145/1138394.1138395 fatcat:26n7ptnsunfvdgpeohslvrseqa

Average-case analysis of perfect sorting by reversals (Journal Version) [article]

Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin
2012 arXiv   pre-print
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence  ...  B\'erard et al. (2007) make use of strong interval trees to describe an algorithm for sorting signed permutations by reversals.  ...  If intervals I and J do not commute, they overlap.  ... 
arXiv:1201.0940v1 fatcat:2rxjeisa2fazncu6b32tgwph6m

AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS

MATHILDE BOUVEL, CEDRIC CHAUVE, MARNI MISHNA, DOMINIQUE ROSSIN
2011 Discrete Mathematics, Algorithms and Applications (DMAA)  
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence  ...  Bérard et al. (2007) make use of strong interval trees to describe an algorithm for sorting signed permutations by reversals.  ...  If intervals I and J do not commute, they overlap.  ... 
doi:10.1142/s1793830911001280 fatcat:r2pklnshtfbs5ck4amg7lpbarq

Declarative Programming [chapter]

2013 Encyclopedia of Systems Biology  
For example, the call pair (Fork (Leaf 0) (Leaf 1)) (Fork (Leaf True) (Leaf False)) yields the following tree with four pairs.  ...  Finite-domain constraints express equations and in-equations over natural numbers with a bounded domain. They can be used to solve many kinds of combinatorial problems efficiently.  ...  The Leaf case follows from the left-identity law because return ≡ Leaf .  ... 
doi:10.1007/978-1-4419-9863-7_100335 fatcat:224vgmt73vbvzepwfux4ufd24e

Declarative Programming [chapter]

Phil Molyneux
1993 Managing with Information Technology  
For example, the call pair (Fork (Leaf 0) (Leaf 1)) (Fork (Leaf True) (Leaf False)) yields the following tree with four pairs.  ...  Finite-domain constraints express equations and in-equations over natural numbers with a bounded domain. They can be used to solve many kinds of combinatorial problems efficiently.  ...  The Leaf case follows from the left-identity law because return ≡ Leaf .  ... 
doi:10.1007/978-1-4471-3299-8_1 fatcat:wcy5wl6whrc6zllofpbutta6yy
« Previous Showing results 1 — 15 out of 6,528 results