Sciweavers

564 search results - page 71 / 113
» Error-tolerant Tree Matching
Sort
View
DAM
2007
107views more  DAM 2007»
14 years 12 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
AC
2000
Springer
15 years 4 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
VLDB
2005
ACM
144views Database» more  VLDB 2005»
15 years 5 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
IJRR
2010
102views more  IJRR 2010»
14 years 10 months ago
View-based Maps
— Robotic systems that can create and use visual maps in realtime have obvious advantages in many applications, from automatic driving to mobile manipulation in the home. In this...
Kurt Konolige, James Bowman, J. D. Chen, Patrick M...
CVPR
2012
IEEE
13 years 2 months ago
City scale geo-spatial trajectory estimation of a moving camera
This paper presents a novel method for estimating the geospatial trajectory of a moving camera with unknown intrinsic parameters, in a city-scale urban environment. The proposed m...
Gonzalo Vaca-Castano, Amir Roshan Zamir, Mubarak S...