A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
Christian Leistner, Martin Godec, Amir Saffari, Ho...
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...