Results 31 to 40 of about 985 (69)
On the pseudorandomness of automatic sequences
We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating functions or from
Mérai, László, Winterhof, Arne
core +1 more source
Mixed Poisson approximation of node depth distributions in random binary search trees
We investigate the distribution of the depth of a node containing a specific key or, equivalently, the number of steps needed to retrieve an item stored in a randomly grown binary search tree.
Grubel, Rudolf, Stefanoski, Nikolce
core +1 more source
Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
Schubert Vanishing is a problem of deciding whether Schubert coefficients are zero. Until this work it was open whether this problem is in the polynomial hierarchy ${{\mathsf {PH}}}$ .
Igor Pak, Colleen Robichaux
doaj +1 more source
The subpower membership problem for semigroups
Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$.
Bulatov, Andrei +3 more
core +1 more source
We suggest a measure of "Eulerianness" of a finite directed graph and define a class of "coEulerian" graphs. These are the graphs whose Laplacian lattice is as large as possible.
Farrell, Matthew, Levine, Lionel
core +1 more source
Optimum matchings in weighted bipartite graphs [PDF]
Given an integer weighted bipartite graph $\{G=(U\sqcup V, E), w:E\rightarrow \mathbb{Z}\}$ we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum weight perfect
C. Vargas, Carlos E. Valencia, Marcos
core
Exact recovery of community detection in k-community Gaussian mixture models
We study the community detection problem on a Gaussian mixture model, in which vertices are divided into $k\geq 2$ distinct communities. The major difference in our model is that the intensities for Gaussian perturbations are different for ...
Zhongyang Li
doaj +1 more source
ORTHOGONAL TRACE-SUM MAXIMIZATION: TIGHTNESS OF THE SEMIDEFINITE RELAXATION AND GUARANTEE OF LOCALLY OPTIMAL SOLUTIONS. [PDF]
Won JH, Zhang T, Zhou H.
europepmc +1 more source
A Regularization Term Based on a Discrete Total Variation for Mathematical Image Processing
In this paper, a new regularization term is proposed to solve mathematical image problems. By using difference operators in the four directions; horizontal, vertical and two diagonal directions, an estimation of derivative amplitude is found.
Hosseini, Alireza
core
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates. [PDF]
Boţ RI, Csetnek ER, Nguyen DK.
europepmc +1 more source

