相关论文: Cutting the same fraction of several measures

We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…

In this paper we demonstrate how to partition the real number line into four subsets which may be reassembled, via "piecewise rigid functions" that preserve Lebesgue measure, into two copies of the line. We then employ a similar process to…

This paper provides a theoretical and numerical investigation of a penalty decomposition scheme for the solution of optimization problems with geometric constraints. In particular, we consider some situations where parts of the constraints…

Suppose $d+1$ absolutely continuous probability measures $m_0, \ldots, m_d$ on $\mathbb{R}^d$ are given. In this paper, we prove that there exists a point of $\mathbb{R}^d$ that belongs to the convex hull of $d+1$ points $v_0, \ldots, v_d$…

We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…

$\newcommand{\Arr}{\mathcal{A}} \newcommand{\numS}{k} \newcommand{\ArrX}[1]{\Arr(#1)} \newcommand{\eps}{\varepsilon} \newcommand{\opt}{\mathsf{o}}$ For point sets $P_1, \ldots, P_\numS$, a set of lines $L$ is halving if any face of the…

The decision to incorporate cross-validation into validation processes of mathematical models raises an immediate question - how should one partition the data into calibration and validation sets? We answer this question systematically: we…

Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is to group together similar objects, or pixels in the case of image processing. At the…

We propose a new 2D shape decomposition method based on the short-cut rule. The short-cut rule originates from cognition research, and states that the human visual system prefers to partition an object into parts using the shortest possible…

We consider the problem of finding a (non-negative) measure $\mu$ on $\mathfrak{B}(\mathbb{C}^n)$ such that $\int_{\mathbb{C}^n} \mathbf{z}^{\mathbf{k}} d\mu(\mathbf{z}) = s_{\mathbf{k}}$, $\forall \mathbf{k}\in\mathcal{K}$. Here…

With the development of machine learning and Big Data, the concepts of linear and non-linear optimization techniques are becoming increasingly valuable for many quantitative disciplines. Problems of that nature are typically solved using…

We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. Then, we use these results in order to write optimality conditions for a special…

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

In this paper we produce a few continuations of our previous work on partitions into fractions. Specifically, we study strictly increasing integer sequences $\{n_j\}$ such that there are partitions for all integers less than the floor of…

We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…

In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…

In this work, we propose a new segmentation algorithm for images containing convex objects present in multiple shapes with a high degree of overlap. The proposed algorithm is carried out in two steps, first we identify the visible contours,…

A formula which only involves a partition number and elementary functions is derived by applying Burnside's Lemma to the set of idempotent maps from a set to itself. One side involves a summation over a set closely related to the partition…

It has been proposed that measurement in quantum mechanics results from spontaneous breaking of a symmetry of the measuring apparatus and could be a unitary process that preserves coherence. Viewed in this manner, it is argued,…

We introduce a stochastic version of the cutting-plane method for a large class of data-driven Mixed-Integer Nonlinear Optimization (MINLO) problems. We show that under very weak assumptions the stochastic algorithm is able to converge to…