Let I be a countably infinite set of points in R, and suppose that I has no points of accumulation and that its convex hull is the whole of R. It will be convenient to index I as {ui: i ∈ Z}, with ui < ui+1 for every i. Consider a continuous-time Markov chain Y = {Y (t) : t ≥ 0} on I

Given any subset of Z we associate to it another set on which we can define one or more (generally independent) abstract factorial functions. These associated sets are studied and arithmetic relations are revealed. In addition, we show that for an abstract factorial function of an infinite subset

very large moves are allowed. The first move we consider is an α-βswap: for a pair of labels α, β, this move exchanges the labels between an arbitrary set of pixels labeled α and another arbitrary set labeled β. Our first algorithm generates a labeling such that there is no swap move that decreases

In this paper, we present a new numerical method for advecting arbitrary sets in a vector field. The method computes a transformation of the domain instead of dealing with particular sets. We propose a way of decoupling the advection and representation steps of the computations, resulting

General characterizations of inductive inference over arbitrary sets of data presentations

algorithm obtains a synopsis that is good for all of Q. We ensure privacy for the rows of the database, but the boosting is performed on the queries. We also provide the first synopsis generators for arbitrary sets of arbitrary low sensitivity

The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of non-adaptive linear measurements, under appropriate conditions on the measurement matrix. The vector model has been

In this paper we demonstrate that finite linear combinations of compositions of a fixed, univariate function and a set ofaffine functionals can uniformly approximate any continuous function of n real variables with support in the unit hypercube; only mild conditions are imposed on the univariate

We prove optimal, up to an arbitrary ffl? 0, inapproximability results for Max-Ek-Sat for k * 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds

as multinomial distributions over a discrete vocabulary, and the HMM parameters are set to maximize the likelihood of the observations. This paper presents a new Markovian sequence model, closely related to HMMs, that allows observations to be represented as arbitrary overlapping features (such as word