Related papers: Minimum search space and efficient methods for str…
This paper proposes a hierarchical clustering approach for the segmentation of mobile LiDAR point clouds. We perform the hierarchical clustering on unorganized point clouds based on a proximity matrix. The dissimilarity measure in the…
Filtered approximate nearest neighbor search (ANNS) restricts the search to data objects whose attributes satisfy a given filter and retrieves the top-$K$ objects that are most semantically similar to the query object. Many graph-based ANNS…
The conventional theory of homogeneous and heterogeneous nucleation in a supersaturated vapor is tested by Monte Carlo simulations of the lattice gas (Ising) model with nearest-neighbor attractive interactions on the simple cubic lattice.…
We present a novel algorithm for (i) detecting approximate symmetries inherently present among spatially localized molecular orbitals and (ii) enforcing these in numerically exact manners by means of unitary optimization techniques. The…
Quantum annealing is a new method for finding extrema of multidimensional functions. Based on an extension of classical, simulated annealing, this approach appears robust with respect to avoiding local minima. Further, unlike some of its…
In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without…
In this work, we propose to use a local clustering approach based on the sparse solution technique to study the medical image, especially the lung cancer image classification task. We view images as the vertices in a weighted graph and the…
We investigate distribution of integral well-rounded lattices in the plane, parameterizing the set of their similarity classes by solutions of the family of Pell-type Diophantine equations of the form $x^2+Dy^2=z^2$ where $D>0$ is…
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…
We propose a relax-and-round approach combined with a greedy search strategy for performing complex lattice basis reduction. Taking an optimization perspective, we introduce a relaxed version of the problem that, while still nonconvex, has…
In this paper, we study a number of well-known combinatorial optimization problems that fit in the following paradigm: the input is a collection of (potentially inconsistent) local relationships between the elements of a ground set (e.g.,…
A primary challenge in metagenomics is reconstructing individual microbial genomes from the mixture of short fragments created by sequencing. Recent work leverages the sparsity of the assembly graph to find $r$-dominating sets which enable…
The coupled cluster method (CCM) is a method of quantum many-body theory that may provide accurate results for the ground-state properties of lattice quantum spin systems even in the presence of strong frustration and for lattices of…
In this paper, we consider the Minimum-Load $k$-Clustering/Facility Location (MLkC) problem where we are given a set $P$ of $n$ points in a metric space that we have to cluster and an integer $k$ that denotes the number of clusters.…
In optimal experimental design, the objective is to select a limited set of experiments that maximizes information about unknown model parameters based on factor levels. This work addresses the generalized D-optimal design problem, allowing…
Traditionally, clustering algorithms focus on partitioning the data into groups of similar instances. The similarity objective, however, is not sufficient in applications where a fair-representation of the groups in terms of protected…
The problem of approximating a dense matrix by a product of sparse factors is a fundamental problem for many signal processing and machine learning tasks. It can be decomposed into two subproblems: finding the position of the non-zero…
Clustering attempts to partition data instances into several distinctive groups, while the similarities among data belonging to the common partition can be principally reserved. Furthermore, incomplete data frequently occurs in many…
The linked cluster expansion has been shown to be highly efficient in calculating equilibrium and nonequilibrium properties of a variety of 1D and 2D classical and quantum lattice models. In this article, we extend the linked cluster method…
It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically…