Sciweavers

558 search results - page 59 / 112
» Trees and Matchings
Sort
View
ICVS
2009
Springer
15 years 6 months ago
Visual Registration Method for a Low Cost Robot
Abstract— An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. I...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 9 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
ICCV
1998
IEEE
16 years 1 months ago
Representation and Self-Similarity of Shapes
Representing shapes is a signi cant problem for vision systems that must recognize or classify objects. We derive a representation for a given shape by investigating its self-simi...
Tyng-Luh Liu, Davi Geiger, Robert Kohn
ICPR
2002
IEEE
16 years 27 days ago
Shape Representation Using Concavity Graphs
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
Ossama El Badawy, Mohamed Kamel
FLOPS
2004
Springer
15 years 3 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar