199 search results - page 21 / 40 » Fast Algorithms for Computing Tree LCS |
115
Voted
ISPDC
2010
IEEE
15 years 9 days ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
118
click to vote
VRST
2009
ACM
15 years 9 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
131
Voted
ICIP
2010
IEEE
15 years 11 days ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
126
click to vote
ACL
2010
15 years 13 days ago
2010
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...
SAC
2002
ACM
15 years 2 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...