680 search results - page 89 / 136 » A randomized embedding algorithm for trees |
ICRA
2000
IEEE
14 years 12 days ago
2000
IEEE
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...
AINA
2010
IEEE
14 years 1 months ago
2010
IEEE
—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...
DASFAA
2007
IEEE
14 years 3 months ago
2007
IEEE
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...
DAGM
2010
Springer
13 years 10 months ago
2010
Springer
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...
GD
2007
Springer
14 years 3 months ago
2007
Springer
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...