in this paper, we investigate the continuity of linear and sublinear correspondences defined on cones in normed spaces. we also generalize some known results for sublinear correspondences.

An abstract numeration system (ANS) is a numeration system that provides a one-to-one correspondence between the natural numbers and a regular language. In this paper, we define an ANS-based compression as an extension of this correspondence. In addition, we show the following results: 1) an average compression ratio is computable from a language, 2) an ANS-based compression runs in sublinear t...

In this paper we provide‎ ‎existence results for positive solution to‎ ‎Dirichlet p(t)-Laplacian boundary value problems‎. ‎The sublinear and‎ ‎superlinear cases are considerd‎.

in this paper we provide‎ ‎existence results for positive solution to‎ ‎dirichlet p(t)-laplacian boundary value problems‎. ‎the sublinear and‎ ‎superlinear cases are considerd‎.

Two of the most fundamental prototypes of greedy optimization are the matching pursuit and FrankWolfe algorithms. In this paper, we take a unified view on both classes of methods, leading to the first explicit convergence rates of matching pursuit methods in an optimization sense, for general sets of atoms. We derive sublinear (1/t) convergence for both classes on general smooth objectives, and...

This contribution extends linear models for feature vectors to sublinear models for graphs and analyzes their properties. The results are (i) a geometric interpretation of sublinear classifiers, (ii) a generic learning rule based on the principle of empirical risk minimization, (iii) a convergence theorem for the margin perceptron in the sublinearly separable case, and (iv) the VC-dimension of ...