1388 search results - page 148 / 278 » Querying Linguistic Trees |
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
111
Voted
PODS
2005
ACM
16 years 26 days ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
109
click to vote
PODS
2006
ACM
16 years 26 days ago
2006
ACM
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
219
Voted
CVIU
2011
14 years 7 months ago
2011
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
169
Voted
ICML
2006
IEEE
15 years 9 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...