632 search results - page 74 / 127 » On the Approximability of the Steiner Tree Problem |
PVLDB
2010
13 years 7 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
The visual world demonstrates organized spatial patterns,
among objects or regions in a scene, object-parts
in an object, and low-level features in object-parts. These
classes o...
DISOPT
2008
13 years 9 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...