4037 search results - page 787 / 808 » Routing without ordering |
141
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
152
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
109
Voted
GIS
2010
ACM
15 years 29 days ago
2010
ACM
We present a method for efficient and reliable geo-positioning of images. It relies on image-based matching of the query images onto a trellis of existing images that provides acc...
127
Voted
ICRA
2010
IEEE
15 years 28 days ago
2010
IEEE
This paper presents a probing-based method for probabilistic localization in automated robotic assembly. We consider peg-in-hole problems in which a needle-like peg has a single p...
137
Voted
IJCV
2010
15 years 26 days ago
2010
We present an information theoretic approach to define the problem of structure from motion (SfM) as a blind source separation one. Given that for almost all practical joint densi...