Related papers: Separator for $c$-Packed Segments and Curves
Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the…
This paper provides a new way to understand the equivariant slice filtration. We give a new, readily checked condition for determining when a $G$-spectrum is slice $n$-connective. In particular, we show that a $G$-spectrum is slice greater…
This paper proposes a method for solving multivariate regression and classification problems using piecewise linear predictors over a polyhedral partition of the feature space. The resulting algorithm that we call PARC (Piecewise Affine…
The purpose of this paper is to prove optimal estimates for solutions of the Kohn-Laplacian for certain classes of model domains in several complex variables. This will be achieved by applying a type of singular integral operator whose…
We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…
Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…
We define and study a spectral recombination algorithm, SpecReCom, for partitioning a graph into a given number of connected parts. It is straightforward to introduce additional constraints such as the requirement that the weight (or number…
We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…
Given a graph $G = (V,E)$ and a terminal $s\in V$, a cut $X$ for $s$ is a vertex set that contains $s$. We look for a cut that is small in two senses, i.e., there are no more than $k$ vertices in $X$ and no more than $t$ edges leaving $X$.…
The purpose of this paper is concerned with the approximate solution of split equality problems. We introduce two types of algorithms and a new self-adaptive stepsize without prior knowledge of operator norms. The corresponding strong…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
We present a family of fast pseudo-approximation algorithms for the minimum balanced vertex separator problem in a graph. Given a graph $G=(V,E)$ with $n$ vertices and $m$ edges, and a (constant) balance parameter $c\in(0,1/2)$, where $G$…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
We compute the class of a divisor on M_{g,n} given as the closure of the locus of smooth pointed curves [C; x_1,..., x_n] for which \sum d_j x_j has an effective representative, where d_j are integers summing up to g-1, not all positive.…
The dimension of spaces of global sections for line bundles on semistable curves parametrized by the compactified Picard scheme is studied. The theorem of Riemann is shown to hold. The theorem of Clifford is shown to hold in the following…
Automatic segmentation of an image to identify all meaningful parts is one of the most challenging as well as useful tasks in a number of application areas. This is widely studied. Selective segmentation, less studied, aims to use limited…
Since the fully convolutional network has achieved great success in semantic segmentation, lots of works have been proposed focusing on extracting discriminative pixel feature representations. However, we observe that existing methods still…
Wiring diagrams are given for a quantum algorithm processor in CMOS to compute, in parallel, all divisors of an n-bit integer. Lines required in a wiring diagram are proportional to n. Execution time is proportional to the square of n.
Reconstructing a finite set of curves from an unordered set of sample points is a well studied topic. There has been less effort that considers how much better the reconstruction can be if tangential information is given as well. We show…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…