Results 31 to 40 of about 477 (109)
Leanness Computation: Small Values and Special Graph Classes [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k.
David Coudert +2 more
doaj +1 more source
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
Advances in Mechanical Engineering, 2020 Recent development in the predictive maintenance field has focused on incorporating artificial intelligence techniques in the monitoring and prognostics of machine health.
E. T. Bekar, Per Nyqvist, A. Skoogh
semanticscholar +1 more source
Distribution-sensitive set multi-partitioning [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Given a set $\mathcal{S}$ with real-valued members, associated with each member one of two possible types; a multi-partitioning of $\mathcal{S}$ is a sequence of the members of $\mathcal{S}$ such that if $x,y \in \mathcal{S}$ have different types and $x <
Amr Elmasry
doaj +1 more source
An extension to overpartitions of Rogers-Ramanujan identities for even moduli [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We investigate class of well-poised basic hypergeometric series $\tilde{J}_{k,i}(a;x;q)$, interpreting these series as generating functions for overpartitions defined by multiplicity conditions.
Sylvie Corteel +2 more
doaj +1 more source
Communications in Computational Physics, 2019 Improving linked-lists for neighbor finding with the use of tree search algorithms is proposed here, aiming to cope with highly non-uniform resolution simulations employing a meshless method.
Shahab Khorasanizade and J. M. M. Sousa
semanticscholar +1 more source
Spanning trees of finite Sierpiński graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We show that the number of spanning trees in the finite Sierpiński graph of level $n$ is given by $\sqrt[4]{\frac{3}{20}} (\frac{5}{3})^{-n/2} (\sqrt[4]{540})^{3^n}$.
Elmar Teufl, Stephan Wagner
doaj +1 more source
Statistical Properties of Similarity Score Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In computational biology, a large amount of problems, such as pattern discovery, deals with the comparison of several sequences (of nucleotides, proteins or genes for instance).
Jérémie Bourdon, Alban Mancheron
doaj +1 more source
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one unit of flow in each vertex other thans.
Cláudio Carvalho +5 more
doaj +1 more source
eLife, 2021 Single-molecule FRET (smFRET) has become a mainstream technique for studying biomolecular structural dynamics. The rapid and wide adoption of smFRET experiments by an ever-increasing number of groups has generated significant progress in sample ...
E. Lerner +45 more
semanticscholar +1 more source