By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbatio...
Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Pat...
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
In this paper we describe an implicit user interface for smart environment control: We make our system guess how to assist the user(s) proactively. Our controller is based on two ...
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di...
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...