Related papers: A Note On Computing Set Overlap Classes
We propose an algorithm for finding overlapping community structure in very large networks. The algorithm is based on the label propagation technique of Raghavan, Albert, and Kumara, but is able to detect communities that overlap. Like the…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous self-similar set is the maximum of the upper box dimensions of the homogeneous counterpart and…
In this work we address the problem of detecting overlapping communities in social networks. Because the word "community" is an ambiguous term, it is necessary to quantify what it means to be a community within the context of a particular…
Given two convex polygons $P$ and $Q$ with $n$ and $m$ edges, the maximum overlap problem is to find a translation of $P$ that maximizes the area of its intersection with $Q$. We give the first randomized algorithm for this problem with…
We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…
The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-Chains [Phys. Rev. A 92(1) 012322]. We present a necessary and sufficient criterion…
A fundamental problem in shape matching and geometric similarity is computing the maximum area overlap between two polygons under translation. For general simple polygons, the best-known algorithm runs in $O((nm)^2 \log(nm))$ time [Mount,…
We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This problem has applications in e.g. information retrieval and…
We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…
Two sets $\mathscr{A}$ and $\mathscr{B}$ are said to be cross-intersecting if $X\cap Y\neq\emptyset$ for all $X\in\mathscr{A}$ and $Y\in\mathscr{B}$. Given two cross-intersecting Sperner families (or antichains) $\mathscr{A}$ and…
A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…
A primary concern of excessive reuse of test datasets in machine learning is that it can lead to overfitting. Multiclass classification was recently shown to be more resistant to overfitting than binary classification. In an open problem of…
Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…
We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
The transversal hypergraph problem is the task of enumerating the minimal hitting sets of a hypergraph. It is a long-standing open question whether this can be done in output-polynomial time. For hypergraphs whose solutions have bounded…
Community discovery in the social network is one of the tremendously expanding areas which earn interest among researchers for the past one decade. There are many already existing algorithms. However, new seed-based algorithms establish an…
Let $[n]$ (resp. $V$) be an $n$-element set (resp. $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$), and $\binom{[n]}{k}$ (resp. $\genfrac{[}{]}{0pt}{}{V}{k}$) denote the set of all $k$-subsets of $[n]$ (resp.…