Related papers: Space-filling Curves for High-performance Data Min…
We study how iterated and composed completely positive maps act on operator-valued kernels. Each kernel is realized inside a single Hilbert space where composition corresponds to applying bounded creation operators to feature vectors. This…
We construct two Hilbert spaces over the set of all metrics of arbitrary but fixed signature, defined on a manifold. Every state in one of the Hilbert spaces is built of an uncountable number of wave functions representing some elementary…
R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to construct and maintain R-trees for two-dimensional points, due to Kamel and Faloutsos, is to keep the points in the order in which they…
Orders on surfaces provide a rich source of examples of noncommutative surfaces. Other than some existence results, very little is known about the various moduli spaces that can be associated to them. Even fewer examples have been…
We study locally Cohen-Macaulay curves in projective three-space which are contained in a double plane 2H, thus completing the classification of curves lying on surfaces of degree two. We describe the irreducible components of the Hilbert…
An inventory of all possible homogenous Hilbert curves in two dimensions are reported. Six new Hilbert curves are described by introducing the reversion operation in the construction algorithm. For each curve, the set of affine…
In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…
It is well-known that the constructions of space-filling curves depend on certain substitution rules. For a given self-similar set, finding such rules is somehow mysterious, and it is the main concern of the present paper. Our first idea is…
The basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely to efficiently perform computations in an intractably large Hilbert space. In this paper we explore some theoretical…
Hilbert space combines the properties of two fundamentally different types of mathematical spaces: vector space and metric space. While the vector-space aspects of Hilbert space, such as formation of linear combinations of state vectors,…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
In this paper, firstly, some applications of Hilbert matrix in image processing and cryptology are mentioned and an algorithm related to the Hilbert view of a digital image is given. In section 2, the new matrix domains are constructed and…
Theoretical studies have proven that the Hilbert space has remarkable performance in many fields of applications. Frames in tensor product of Hilbert spaces were introduced to generalize the inner product to high-order tensors. However,…
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…
Isomorphisms of separable Hilbert spaces are analogous to isomorphisms of n-dimensional vector spaces. However, while n-dimensional spaces in applications are always realized as the Euclidean space R^n, Hilbert spaces admit various useful…
For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…
We examine several matrix layouts based on space-filling curves that allow for a cache-oblivious adaptation of parallel TU decomposition for rectangular matrices over finite fields. The TU algorithm of \cite{Dumas} requires index conversion…
In this paper we deal with a scale of reproducing kernel Hilbert spaces $H^{(n)}_2$, $n\ge 0$, which are linear subspaces of the classical Hilbertian Hardy space on the right-hand half-plane $\mathbb{C}^+$. They are obtained as ranges of…
We study reproducing kernel Hilbert spaces introduced as ranges of generalized Ces\`aro-Hardy operators, in one real variable and in one complex variable. Such spaces can be seen as formed by absolutely continuous functions on the positive…
Several aspects of managing a sensor network (e.g., motion planning for data mules, serial data fusion and inference) benefit once the network is linearized to a path. The linearization is often achieved by constructing a space filling…