Related papers: Space-filling Curves for High-performance Data Min…
In his 1990 Inventiones paper, P. Jones characterized subsets of rectifiable curves in the plane, using a multiscale sum of what is now known as Jones $\beta$-numbers, numbers measuring flatness in a given scale and location. This work was…
Lebesgue curve is a space-filling curve that fills the unit square through linear interpolation. In this study, we generalise Lebesgue's construction to generate space-filling curves from any given planar substitution satisfying a mild…
We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a parameter along an integral curve of the gradient of a function $f$ on that domain; suitable functions have exactly one critical point, a maximum,…
The blown up complex projective plane in the twelve triple points of the dual Hesse arrangement has an infinite number of irreducible rational curves of self-intersection $-1$, for short, $(-1)$-curves. In the preprint version of [Dumnicki,…
Let C be a projective curve defined over a field k and let D be a divisor of C. The Riemann-Roch space L(D) is the set of rational functions on C for which certain zeros are imposed and certain poles are allowed, with some multiplicities…
This paper presents a hybrid approach to spatial indexing of two dimensional data. It sheds new light on the age old problem by thinking of the traditional algorithms as working with images. Inspiration is drawn from an analogous situation…
Let $(B(t),\,t\ge0)$ denote the standard, one-dimensional Wiener process and $(\ell(y,t);\, y\in\mathbb{R},\, t\ge0)$ its local time at level $y$ up to time $t$. Then $\big( (B(t),\, \ell(B(t),t)),\; t\ge0 \big)$ is a random path that fills…
In this paper, we deal with the problem of curves clustering. We propose a nonparametric method which partitions the curves into clusters and discretizes the dimensions of the curve points into intervals. The cross-product of these…
We consider the Hilbert scheme H(d,g) of space curves C with homogeneous ideal I(C):=H_{*}^0(\sI_C) and Rao module M:=H_{*}^1(\sI_C). By taking suitable generizations (deformations to a more general curve) C' of C, we simplify the minimal…
The wide applicability of kernels makes the problem of max-kernel search ubiquitous and more general than the usual similarity search in metric spaces. We focus on solving this problem efficiently. We begin by characterizing the inherent…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
A consistent description of images on the disk and of their transformations is given as elements of a vector space and of an operators algebra. The vector space of images on the disk $\mathbb{D}$ is the Hilbert space $L^2(\mathbb{D})$ that…
Exploration systems are critical for enhancing the autonomy of robots. Due to the unpredictability of the future planning space, existing methods either adopt an inefficient greedy strategy or require a lot of resources to obtain a global…
Exemplar-based inpainting is the process of reconstructing missing parts of an image by searching the remaining data for patches that fit seamlessly. The image is completed to a plausible-looking solution by repeatedly inserting the patch…
An algebraic structure of matter spectrum is studied. It is shown that a base mathematical construction, lying in the ground of matter spectrum (introduced by Heisenberg) , is a two-level Hilbert space. Two-level structure of the Hilbert…
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…
Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…
We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…