Related papers: Cyclic space-filling curves and their clustering p…
A bounded curvature path is a continuously differentiable piece-wise $C^2$ path with bounded absolute curvature connecting two points in the tangent bundle of a surface. These paths have been widely considered in computer science and…
A new method for hierarchical clustering is presented. It combines treelets, a particular multiscale decomposition of data, with a projection on a reproducing kernel Hilbert space. The proposed approach, called kernel treelets (KT),…
In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…
This paper proposes a new distance metric between clusterings that incorporates information about the spatial distribution of points and clusters. Our approach builds on the idea of a Hilbert space-based representation of clusters as a…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
The cluster algorithm in the fully frustrated Ising model on the square lattice is essentially different from the ones used in other systems. Thus its better understanding is particularly important for finding new lines of development.…
Based on the seminal work on Array-RQMC methods and rank-1 lattice sequences by Pierre L'Ecuyer and collaborators, we introduce efficient deterministic algorithms for image synthesis. Enumerating a low discrepancy sequence along the Hilbert…
We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting.…
In this paper we prove that, for any $n\ge 3$, there exist infinitely many $r\in \N$ and for each of them a smooth, connected curve $C_r$ in $\P^r$ such that $C_r$ lies on exactly $n$ irreducible components of the Hilbert scheme…
In this paper, we construct a bijective mapping between a biquadratic spline space over the hierarchical T-mesh and the piecewise constant space over the corresponding crossing-vertex-relationship graph (CVR graph). We propose a novel…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
Hierarchical clustering studies a recursive partition of a data set into clusters of successively smaller size, and is a fundamental problem in data analysis. In this work we study the cost function for hierarchical clustering introduced by…
We introduce an orbifold induction procedure which provides a systematic construction of cyclic orbifolds, including their twisted sectors. The procedure gives counterparts in the orbifold theory of all the current-algebraic constructions…
We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
$\mathcal{H}-$holomorphic curves are solutions of a specific modification of the pseudoholomorphic curve equation in symplectizations involving a harmonic $1-$form as perturbation term. In this paper we compactify the moduli space of…
We consider the classic correlation clustering problem in the hierarchical setting. Given a complete graph $G=(V,E)$ and $\ell$ layers of input information, where the input of each layer consists of a nonnegative weight and a labeling of…
In this paper we focus on various aspects of singular complex plane curves, mostly in the context of their homological properties and the associated combinatorial structures. We formulate some challenging open problems that can point to new…
Our motivation is to build a systematic method in order to investigate the structure of cluster algebras of geometric type. The method is given through the notion of mixing-type sub-seeds, the theory of seed homomorphisms and the view-point…