Results 21 to 30 of about 1,392 (94)
Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Consider a countable alphabet $\mathcal{A}$. A multi-modular hidden pattern is an $r$-tuple $(w_1,\ldots , w_r)$, where each $w_i$ is a word over $\mathcal{A}$ called a module.
Loïck Lhote, Manuel E. Lladser
doaj +1 more source
Efficient estimation of the cardinality of large data sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Giroire has recently proposed an algorithm which returns the $\textit{approximate}$ number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases.
Philippe Chassaing, Lucas Gerin
doaj +1 more source
Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method. [PDF]
, 2019 Recent advances in selected configuration interaction methods have made them competitive with the most accurate techniques available and, hence, creating an increasingly powerful tool for solving quantum Hamiltonians.
Freeman, C Daniel +5 more
core +2 more sources
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
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
Embeddings of Schatten Norms with Applications to Data Streams [PDF]
, 2017 A_poly(nd) in R^{n x d}, suppose we want to construct a linear map L such that L(A_i) in R^{n\u27 x d\u27} for each i, where n\u27 = 1. Then how large do n\u27 and d\u27 need to be as a function of D_{p,q}? We nearly resolve this question for every p, q
Li, Yi, Woodruff, David P.
core +2 more sources
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
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