English
Related papers

Related papers: Qualitative Properties of $k-$Center Problems

200 papers

Given a compact subset of a Banach space, the Chebyshev center problem consists of finding a minimal circumscribing ball containing the set. In this article we establish a numerically tractable algorithm for solving the Chebyshev center…

Optimization and Control · Mathematics 2023-07-06 Pradyumna Paruchuri , Debasish Chatterjee

Using the Post-Minkowskian formalism and considering rotation as a perturbation, we compute an approximate interior solution for a stationary perfect fluid with constant density and axial symmetry. A suitable change of coordinates allows…

General Relativity and Quantum Cosmology · Physics 2007-05-23 J. A. Cabezas , E. Ruiz

In mathematical modelling, the data and solutions are represented as measurable functions and their quality is oftentimes captured by the membership to a certain function space. One of the core questions for an analysis of a model is the…

Functional Analysis · Mathematics 2022-11-22 Vít Musil , Luboš Pick , Jakub Takáč

In this article, we introduce a $k$-th capillary area measure for capillary convex bodies in the Euclidean half-space, which serves as a boundary counterpart to the classical concept of area measure (see, e.g., \cite[Chapter 8]{Sch}). We…

Analysis of PDEs · Mathematics 2026-05-19 Xinqun Mei , Guofang Wang , Liangjun Weng

We consider finite point subsets (distributions) in compact metric spaces. Non-trivial bounds for sums of distances between points of distributions and for discrepancies of distributions in metric balls are given in the case of general…

Combinatorics · Mathematics 2015-12-02 M. M. Skriganov

The $k$-median and $k$-means clustering objectives are classic objectives for modeling clustering in a metric space. Given a set of points in a metric space, the goal of the $k$-median (resp. $k$-means) problem is to find $k$ representative…

Computational Geometry · Computer Science 2026-03-11 Vincent Cohen-Addad , Karthik C. S. , David Saulpic , Chris Schwiegelshohn

The input to the \emph{sets-$k$-means} problem is an integer $k\geq 1$ and a set $\mathcal{P}=\{P_1,\cdots,P_n\}$ of sets in $\mathbb{R}^d$. The goal is to compute a set $C$ of $k$ centers (points) in $\mathbb{R}^d$ that minimizes the sum…

Machine Learning · Computer Science 2020-03-10 Ibrahim Jubran , Murad Tukan , Alaa Maalouf , Dan Feldman

In this paper, we address the topic of envelopes created by pseudo-circle families in the Minkowski plane, which exhibit some different properties when compared with the Euclidean case. We provide solutions to all four basic problems…

Differential Geometry · Mathematics 2024-07-11 Yongqiao Wang , Lin Yang , Yuan Chang , Pengcheng Li

For $p\in (-\infty,0)\cup(0,1)$ and a convex body $K\subset\mathbb{R}^n$ with the origin in its interior, we construct the family of $p$-affine dual curvature measures $\mathcal{I}_p(K,\cdot)$ with respect to $K$. The affine-invariant…

Metric Geometry · Mathematics 2026-03-06 Youjiang Lin , Yuchi Wu

The clustering problem, in its many variants, has numerous applications in operations research and computer science (e.g., in applications in bioinformatics, image processing, social network analysis, etc.). As sizes of data sets have grown…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-10-24 Sayan Bandyapadhyay , Tanmay Inamdar , Shreyas Pai , Sriram V. Pemmaraju

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

We prove a quantitative version of the isoperimetric inequality for a non local perimeter of Minkowski type. We also apply this result to study isoperimetric problems with repulsive interaction terms, under convexity constraints. We show…

Analysis of PDEs · Mathematics 2017-09-26 Annalisa Cesaroni , Matteo Novaga

In this paper, we use the Approximation Formula for the Fourier transform of the solution set of lattice points on k-spheres and methods of Bourgain and Ionescu to refine the l^p(Z^d)-boundedness results for discrete k- spherical maximal…

Classical Analysis and ODEs · Mathematics 2015-09-16 Kevin Hughes

The Minkowski product of unit quaternion sets is introduced and analyzed, motivated by the desire to characterize the overall variation of compounded spatial rotations that result from individual rotations subject to known uncertainties in…

Complex Variables · Mathematics 2019-05-29 Rida T. Farouki , Graziano Gentili , Hwan Pyo Moon , Caterina Stoppato

In real applications, database systems should be able to manage and process data with uncertainty. Any real dataset may have missing or rounded values, also the values of data may change by time. So, it becomes important to handle these…

Computational Geometry · Computer Science 2020-06-12 Sharareh Alipour

We explicitly demonstrate the existence of static global defect solutions of arbitrary dimensionality whose energy does not diverge at spatial infinity, by considering maximally symmetric solutions described by an action with non-standard…

High Energy Physics - Theory · Physics 2011-07-05 P. P. Avelino , D. Bazeia , R. Menezes , J. G. G. S. Ramos

A family of fractal arrangements of circles is introduced for each imaginary quadratic field $K$. Collectively, these arrangements contain (up to an affine transformation) every set of circles in the extended complex plane with integral…

Number Theory · Mathematics 2022-02-23 Daniel Martin

We obtain solutions of Einstein's equations describing gravitational field outside a noncanonical global monopole with cosmological constant. In particular, we consider two models of k-monopoles: the Dirac-Born-Infeld (DBI) and the…

General Relativity and Quantum Cosmology · Physics 2016-10-14 Ilham Prasetyo , Handhika S. Ramadhan

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

Computational Geometry · Computer Science 2026-03-26 Matthias Bentert , Fedor v. Fomin , Petr A. Golovach , Souvik Saha , Sanjay Seetharaman , Kirill Simonov , Anannya Upasana

This paper presents a novel accelerated exact k-means algorithm called the Ball k-means algorithm, which uses a ball to describe a cluster, focusing on reducing the point-centroid distance computation. The Ball k-means can accurately find…

Machine Learning · Computer Science 2020-05-05 Shuyin Xia , Daowan Peng , Deyu Meng , Changqing Zhang , Guoyin Wang , Zizhong Chen , Wei Wei
‹ Prev 1 8 9 10 Next ›