Related papers: Computing the probability of intersection
Many state-of-the-art methods for safety assessment and motion planning for automated driving require estimation of the probability of collision (POC). To estimate the POC, a shape approximation of the colliding actors and probability…
We revisit the classic local graph exploration algorithm ApproxContributions proposed by Andersen, Borgs, Chayes, Hopcroft, Mirrokni, and Teng (WAW '07, Internet Math. '08) for computing an $\epsilon$-approximation of the PageRank…
Maximum likelihood estimation is a fundamental computational problem in statistics. In this note, we give a bound for the maximum likelihood degree of algebraic statistical models for discrete data. As usual, such models are identified with…
The mutual information between two jointly distributed random variables $X$ and $Y$ is a functional of the joint distribution $P_{XY},$ which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of…
Developing an idea of M. Gromov, we study the intersection formula for random subsets with density. The \textit{density} of a subset $A$ in a finite set $E$ is defined by $dens A := \log_{|E|}(|A|)$. The aim of this article is to give a…
Let $G$ be a graph on $n$ vertices of maximum degree $\Delta$. We show that, for any $\delta > 0$, the down-up walk on independent sets of size $k \leq (1-\delta)\alpha_c(\Delta)n$ mixes in time $O_{\Delta,\delta}(k\log{n})$, thereby…
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…
In this note, we consider a complete intersection $X=\{x\in \mathbb{R}^n : f_1(x)= \ldots = f_m(x)=0\}, n>m$ and study its Euclidean distance degree in terms of the mixed volume of the Newton polytopes. We show that if the Newton polytopes…
Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…
In this paper, we relate the problem of finding a maximum clique to the intersection number of the input graph (i.e. the minimum number of cliques needed to edge cover the graph). In particular, we consider the maximum clique problem for…
The application of current generation computing machines in safety-centric applications like implantable biomedical chips and automobile safety has immensely increased the need for reviewing the worst-case error behavior of computing…
This Engineering Note addresses the challenge of estimating the probability of collision for tethered spacecraft during close encounters with other space objects. Standard probability of collision methods, based on spherical hard-body…
We present measurements of Underlying Event observables in pp collisions at $\sqrt{s}$ = 0.9 and 7 TeV. The analysis is performed as a function of the highest charged-particle transverse momentum $p_{\rm T, LT}$ in the event. Different…
Given $n$ elements, an integer $k$ and a parameter $\varepsilon$, we study to select an element with rank in $(k-n\varepsilon,k+n\varepsilon]$ using unreliable comparisons where the outcome of each comparison is incorrect independently with…
If $\alpha$ is a probability on $\mathbb{R}^d$ and $t>0,$ consider the Dirichlet random probability $P_t\sim\mathcal{D}(t\alpha) ;$ it is such that for any measurable partition $(A_0,\ldots,A_k)$ of $\mathbb{R}^d$ then…
We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…
We present a $(1- \varepsilon)$-approximation algorithms for maximum cardinality matchings in disk intersection graphs -- all with near linear running time. We also present estimation algorithm that returns $(1\pm…
A very simple example of an algorithmic problem solvable by dynamic programming is to maximize, over sets A in {1,2,...,n}, the objective function |A| - \sum_i \xi_i 1(i \in A,i+1 \in A) for given \xi_i > 0. This problem, with random…
In this paper we study the NP-Hard problem of maximizing the distance over an intersection of balls to a given point. We expand the results found in \cite{funcos1}, where the authors characterize the farthest in an intersection of balls…
Given an irreducible variety $X$ over a finite field, the density of hypersurfaces of varying degree $d$ intersecting $X$ in an irreducible subvariety is $1$, by a result of Charles and Poonen. In this note, we analyse the situation fixing…