Search Results for author:
Found 5 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).
Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits
The classic cake-cutting problem provides a model for addressing the fair and efficient allocation of a divisible, heterogeneous resource among agents with distinct preferences.
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
Parsisanj: a semi-automatic component-based approach towards search engine evaluation
Accessing to required data on the internet is wide via search engines in the last two decades owing to the huge amount of available data and the high rate of new data is generating daily.
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
