A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Preprocessing Ambiguous Imprecise Points

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

doi:10.4230/lipics.socg.2019.42
dblp:conf/compgeom/HoogKLS19
fatcat:wgcoyvfydncrvhykoufl6baie4
*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. ...##
###
A unified analysis of niche overlap incorporating data of different types

2010
*
Methods in Ecology and Evolution
*

We then describe null model

doi:10.1111/j.2041-210x.2010.00070.x
fatcat:adxdspbckna35ivkptszkf6thy
*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. ...##
###
Pattern avoidance in binary trees

2010
*
Journal of combinatorial theory. Series A
*

We provide an algorithm for computing the generating function that counts n-

doi:10.1016/j.jcta.2010.03.004
fatcat:xevgwqxe2fgdzb2fsd53qxiexi
*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! ...##
###
Permutative rewriting and unification

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 . ...

##
###
Non-Contiguous Pattern Avoidance in Binary Trees
[article]

2012
*
arXiv
*
pre-print

Finally, we explore connections between pattern-avoiding trees and pattern-avoiding

arXiv:1203.0795v2
fatcat:z3sywfnjmzhnjg37thhkryp5qm
*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. ...##
###
Disentangling age- and disease-related alterations in schizophrenia brain network using structural equation modeling: A graph theoretical study based on minimum spanning tree

2021
*
Human Brain Mapping
*

In this study, we aimed to use minimum spanning tree (MST) as an unbiased network reconstruction and employed structural

doi:10.1002/hbm.25403
pmid:33960579
pmcid:PMC8193510
fatcat:gnvzt4s5a5fg3kdokjezlzoyzy
*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 ...##
###
Operadic Gröbner Bases: An Implementation
[chapter]

2010
*
Lecture Notes in Computer Science
*

The composition maps are parametrized by arbitrary

doi:10.1007/978-3-642-15582-6_42
fatcat:mee653cn7zcmfdyipu25ayal7e
*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. ...##
###
The Better Accuracy of Strassen-Winograd Algorithms (FastMMW)

2014
*
Advances in Linear Algebra and Matrix Theory
*

Marco Bodrato had the idea of

doi:10.4236/alamt.2014.41002
fatcat:xecwi3guffdonkff5uyhksrtdu
*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*. ...##
###
Average-Case Analysis of Perfect Sorting by Reversals
[chapter]

2009
*
Lecture Notes in Computer Science
*

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed

doi:10.1007/978-3-642-02441-2_28
fatcat:rrkj5qxu5fhqzkmhq3jxxwklpq
*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*. ...##
###
Related plants tend to share pollinators and herbivores, but strength of phylogenetic signal varies among plant families

2020
*
New Phytologist
*

proportional and absolute

doi:10.1111/nph.16420
pmid:31917859
fatcat:wkcn3pbmwne6lghi2zshn4rigm
*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. ...##
###
Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach

2006
*
ACM Transactions on Database Systems
*

In particular, it has been shown that both the

doi:10.1145/1138394.1138395
fatcat:26n7ptnsunfvdgpeohslvrseqa
*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. ...##
###
Average-case analysis of perfect sorting by reversals (Journal Version)
[article]

2012
*
arXiv
*
pre-print

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed

arXiv:1201.0940v1
fatcat:2rxjeisa2fazncu6b32tgwph6m
*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*. ...##
###
AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS

2011
*
Discrete Mathematics, Algorithms and Applications (DMAA)
*

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed

doi:10.1142/s1793830911001280
fatcat:r2pklnshtfbs5ck4amg7lpbarq
*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*. ...##
###
Declarative Programming
[chapter]

2013
*
Encyclopedia of Systems Biology
*

For example, the call pair (Fork (

doi:10.1007/978-1-4419-9863-7_100335
fatcat:224vgmt73vbvzepwfux4ufd24e
*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*. ...##
###
Declarative Programming
[chapter]

1993
*
Managing with Information Technology
*

For example, the call pair (Fork (

doi:10.1007/978-1-4471-3299-8_1
fatcat:wcy5wl6whrc6zllofpbutta6yy
*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*. ...
« Previous

*Showing results 1 — 15 out of 6,528 results*