Results 21 to 30 of about 46,580 (177)
A parallel ADMM-based convex clustering method
EURASIP Journal on Advances in Signal Processing, 2022 Convex clustering has received recently an increased interest as a valuable method for unsupervised learning. Unlike conventional clustering methods such as k-means, its formulation corresponds to solving a convex optimization problem and hence ...
Lidija Fodor +3 more
doaj +1 more source
Contacts in totally separable packings in the plane and in high dimensions
Journal of Computational Geometry, 2022 We study the contact structure of totally separable packings of translates of a convex body K in Rd, that is, packings where any two touching bodies have a separating hyperplane that does not intersect the interior of any translate in the packing.
Márton Naszódi, Konrad Swanepoel
doaj +1 more source
On the quermassintegrals of convex bodies [PDF]
Journal of Inequalities and Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, C, Cheung, WS
openaire +4 more sources
IEEE Access, 2023 To improve the performance of the rigid body localization (RBL) in the non-line-of-sight (NLOS) environment, this paper delves into a joint estimation method about the wireless signal transmission parameter and the attitude parameters of the rigid body ...
Pengwu Wan +3 more
doaj +1 more source
MATHEMATICA SCANDINAVICA, 1990 There are several ways to generalize the classical concept of affine surface area of a sufficiently smooth convex body \(K\) in \(\mathbb{R}^ n\) due to Blaschke to arbitrary convex bodies [see \textit{K. Leichtweiss}, Manuscr. Math. 56, 429-464 (1986; Zbl 0588.52011), \textit{E. Lutwak}, Adv. Math. 85, No. 1, 39-68 (1991; Zbl 0727.53016) and \textit{C.
Werner, Elisabeth, Schütt, Carsten
openaire +3 more sources
Nested Convex Bodies are Chaseable [PDF]
Algorithmica, 2018 In the Convex Body Chasing problem, we are given an initial point $v_0$ in $R^d$ and an online sequence of $n$ convex bodies $F_1, ..., F_n$. When we receive $F_i$, we are required to move inside $F_i$. Our goal is to minimize the total distance travelled. This fundamental online problem was first studied by Friedman and Linial (DCG 1993).
Nikhil Bansal 0001 +4 more
openaire +11 more sources
The Heat Transfer Problem in a Non-Convex Body—A New Procedure for Constructing Solutions
Axioms, 2023 The subject of this work is the coupled steady-state conduction-radiation-convection heat transfer phenomenon in a non-convex blackbody, which is represented by a second-order partial differential equation (representing the heat conduction inside the ...
Rogério Martins Saldanha da Gama
doaj +1 more source
Caenorhinus lobanovi, a new species of the tribe Deporaini (Coleoptera: Rhynchitidae) from Laos [PDF]
Кавказский энтомологический бюллетень, 2021 A new species, Caenorhinus (Flavodeporaus) lobanovi sp. n. from Central Laos is described and illustrated. This new species differs from Caenorhinus (Flavodeporaus) guskovae Legalov, 2021 from Laos in the unicoloured body (in C.
A.A. Legalov
doaj +1 more source
Order Types of Convex Bodies [PDF]
Order, 2010 We give new bounds on the Erdos-Szekeres theorems for convex bodies of Bisztriczky and Fejes Toth and of Pach and Toth. We derive them from a combinatorial characterization of convex position of a family of planar convex bodies. This characterization confirms that the concept of Order Type for points can be extended to noncrossing families of convex ...
Hubard, Alfredo +3 more
openaire +4 more sources
Competitively Chasing Convex Bodies [PDF]
SIAM Journal on Computing, 2019 Let $\mathcal{F}$ be a family of sets in some metric space. In the $\mathcal{F}$-chasing problem, an online algorithm observes a request sequence of sets in $\mathcal{F}$ and responds (online) by giving a sequence of points in these sets. The movement cost is the distance between consecutive such points.
Sébastien Bubeck +3 more
openaire +3 more sources