564 search results - page 46 / 113 » Error-tolerant Tree Matching |
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present a large-scale object retrieval system. The user supplies a query object by selecting a region of a query image, and the system returns a ranked list of i...
PAMI
2008
14 years 12 months ago
2008
Suppose a set of arbitrary (unlabeled) images contains frequent occurrences of 2D objects from an unknown category. This paper is aimed at simultaneously solving the following rel...
114
click to vote
IANDC
2011
14 years 6 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
COCOON
1999
Springer
15 years 4 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
IJCGA
2006
14 years 12 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...