In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
Nenad Dedic, Mariusz H. Jakubowski, Ramarathnam Ve...
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...