4137 search results - page 48 / 828 » On the number of matchings of a tree |
105
click to vote
COCOON
2009
Springer
15 years 8 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
119
Voted
ADC
2008
Springer
15 years 3 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
115
click to vote
ISCIS
2009
Springer
15 years 6 months ago
2009
Springer
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
120
click to vote
ICCV
2009
IEEE
16 years 6 months ago
2009
IEEE
A prototype-based approach is introduced for action
recognition. The approach represents an action as a se-
quence of prototypes for efficient and flexible action match-
ing in ...
119
click to vote
ICIP
2004
IEEE
16 years 3 months ago
2004
IEEE
This paper presents an object recognition method that exploits the representation of the images obtained by means of a Binary Partition Tree (BPT). The shape matching technique in...