Search Results for author:
Found 4 papers, 2 papers with code
Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering
Given a set of points labeled with $k$ labels, we introduce the heat map sorting problem as reordering and merging the points and dimensions while preserving the clusters (labels).
Computing The Packedness of Curves
Assuming $L$ is the diameter of $P$ and $\delta$ is the minimum distance between points on disjoint edges of $P$, we show the approximation factor of the existing $O(\frac{\log (L/\delta)}{\epsilon}n^3)$ time algorithm is $1+\epsilon$-approximation algorithm.
Computational Geometry
A Data-Structure for Approximate Longest Common Subsequence of A Set of Strings
Given a set of $k$ strings $I$, their longest common subsequence (LCS) is the string with the maximum length that is a subset of all the strings in $I$.
Data Structures and Algorithms
A Composable Coreset for k-Center in Doubling Metrics
A set of points $P$ in a metric space and a constant integer $k$ are given.
Data Structures and Algorithms Computational Geometry
