462 search results - page 27 / 93 » Covering a Tree by a Forest |
ESWS
2009
Springer
14 years 2 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
DAGM
2010
Springer
13 years 8 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...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper we present a systematic study of the performance of seven different configurations of GPS on a moving vehicle using three different GPS receivers. The seven diff...
ICCV
2009
IEEE
15 years 11 days ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
SODA
1990
ACM
13 years 8 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...