Related papers: Patterns in sequences
Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this…
Choices in the semantics and the signature of a theory are integral in determining how the theory is used and how challenging it is to reason over it. Our interest in this paper lies in the SMT theory of sequences. Various versions of it…
The efficacy of robust optimization spans a variety of settings with uncertainties bounded in predetermined sets. In many applications, uncertainties are affected by decisions and cannot be modeled with current frameworks. This paper takes…
Wideband communication receivers often deal with the problems of detecting weak signals from distant sources received together with strong nearby interferers. When the techniques of random modulation are used in communication system…
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
Finding models for linear-time properties is a central problem in verification and planning. We study the distribution of linear-time models by investigating the density of linear-time properties over the space of ultimately periodic words.…
We consider a planar dynamical system generated by two stable linear vector fields with distinct fixed points and random switching between them. We characterize singularities of the invariant density in terms of the switching rates and…
Hyperuniform structures possess the ability to confine and drive light, although their fabrication is extremely challenging. Here we demonstrate that speckle patters obtained by a superposition of randomly arranged sources of Bessel beams…
In this paper, we study the detection boundary for minimax hypothesis testing in the context of high-dimensional, sparse binary regression models. Motivated by genetic sequencing association studies for rare variant effects, we investigate…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interested in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general…
The need to analyze information from streams arises in a variety of applications. One of its fundamental research directions is to mine sequential patterns over data streams. Current studies mine series of items based on the presence of the…
In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…
The binary Defect Combination Problem consists in finding a fully working subset from a given ensemble of imperfect binary components. We determine the typical properties of the model using methods of statistical mechanics, in particular,…
We discuss the problem of extending data mining approaches to cases in which data points arise in the form of individual graphs. Being able to find the intrinsic low-dimensionality in ensembles of graphs can be useful in a variety of…
The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
Histograms are convenient non-parametric density estimators, which continue to be used ubiquitously. Summary quantities estimated from histogram-based probability density models depend on the choice of the number of bins. We introduce a…
We study a hypothesis testing problem in which data is compressed distributively and sent to a detector that seeks to decide between two possible distributions for the data. The aim is to characterize all achievable encoding rates and…
Given a set $S$ of small measure, we discuss existence of sampling sequences for the Paley-Wiener space $PW_S$, which have both densities and sampling bounds close to the optimal ones.