2366 search results - page 163 / 474 » Mapping time |
141
Voted
ICCV
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
133
Voted
AICCSA
2001
IEEE
15 years 7 months ago
2001
IEEE
In this paper, we propose a new version of the topological maps algorithm, which has been used to cluster web site visitors. These are characterized by partially redundant variabl...
141
Voted
ISEMANTICS
2010
15 years 5 months ago
2010
In this paper, when we use the term ontology, we are primarily referring to linked data in the form of RDF(S). The problem of ontology mapping has attracted considerable attention...
164
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
143
Voted
AIPS
2009
15 years 4 months ago
2009
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...