The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
In this paper, we propose a new, hierarchical approach to landmark selection for simultaneous robot localization and mapping based on visual sensors: a biologically motivated atte...
Simone Frintrop, Patric Jensfelt, Henrik I. Christ...
In this paper, we introduce the versatile creative tool called "I/O Plant" which generates new-style interactions among humans, plants and computers. It enables designer...