Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
We address the task of computing vector space representations for the meaning of word occurrences, which can vary widely according to context. This task is a crucial step towards ...
In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space Wk p (Rs )(1 p ) to a vector refinement equation with a general dil...
When dealing with convex functions defined on a normed vector space X the biconjugate is usually considered with respect to the dual system (X, X ), that is, as a function defined...
Abstract. In this paper we discuss sparse least squares support vector regressors (sparse LS SVRs) defined in the reduced empirical feature space, which is a subspace of mapped tr...