paper-with-me

Papers

Towards the methodology for solving the minimum enclosing ball and related problems

2024-10-14 · Michael N. Vrahatis

Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean space. Mathematical formulation and typical methods for solving this problem are presented. Also, the paper is focused on areas that are related to this problem, namely: (a) promise problems and property testing, (b) theorems for partitioning and enclosing (covering) a set, and (c) computation of the diameter of a set.

📄 PDF Abstract BibTeX arXiv:2410.11063

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Towards the mathematical foundation of the minimum enclosing ball and related problems

2024-01-09 · Michael N. Vrahatis

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given b…

On a minimum enclosing ball of a collection of linear subspaces

2020-03-27 · Timothy Marrinan, P. -A. Absil, Nicolas Gillis

This paper concerns the minimax center of a collection of linear subspaces. When the subspaces are $k$-dimensional subspaces of $\mathbb{R}^n$, this can be cast as finding the center of a minimum enclosing ball on a Gras…

Learning Kernels with Radiuses of Minimum Enclosing Balls

2010-12-01 · NeurIPS 2010 12 · Kun Gai, Guangyun Chen, Chang-Shui Zhang

In this paper, we point out that there exist scaling and initialization problems in most existing multiple kernel learning (MKL) approaches, which employ the large margin principle to jointly learn both a kernel and an S…

Feature Selection for Linear SVM with Provable Guarantees

2014-06-01 · Saurabh Paul, Malik Magdon-Ismail, Petros Drineas

We give two provably accurate feature-selection techniques for the linear SVM. The algorithms run in deterministic and randomized time respectively. Our algorithms can be used in an unsupervised or supervised setting. Th…

feature selection

Coresets for Minimum Enclosing Balls over Sliding Windows

2019-05-09 · Yanhao Wang, Yuchen Li, Kian-Lee Tan

\emph{Coresets} are important tools to generate concise summaries of massive datasets for approximate analysis. A coreset is a small subset of points extracted from the original point set such that certain geometric prop…