199 search results - page 14 / 40 » Fast Algorithms for Computing Tree LCS |
SPAA
1998
ACM
15 years 4 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
102
click to vote
CIVR
2009
Springer
15 years 6 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
NIPS
2003
15 years 1 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
118
click to vote
COMGEO
2000
ACM
14 years 11 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
84
Voted
LCN
2007
IEEE
15 years 6 months ago
2007
IEEE
—The most common technology in Local Area Networks is the Ethernet protocol. The continuing evolution of Ethernet has propelled it into the scope of Metropolitan Area Networks. E...