Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
We define and study a calculus of discontinuity, a version of displacement calculus, which is a logic of segmented strings in exactly the same sense that the Lambek calculus is a ...
Abstract. In this paper we adopt a temporal coding approach to neuronal modeling of the visual cortex, using oscillations. We propose a hierarchy of three processing modules corres...
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...