A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
This paper discusses the application of robotic technologies to an evacuation assistance task. We describe how this kind of task differs from the more prevalent search and rescue ...
User queries on extensible markup language (XML) documents are typically expressed as regular path expressions. A variety of indexing techniques for efficiently retrieving the re...
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
Baldwin's classic hypothesis states that behavioral plasticity can speed evolution by (a) smoothing the fitness landscape and (b) indirect genetic assimilation of acquired cha...