199 search results - page 18 / 40 » Fast Algorithms for Computing Tree LCS |
126
Voted
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
137
click to vote
JMLR
2010
14 years 9 months ago
2010
Current research on data stream classification mainly focuses on certain data, in which precise and definite value is usually assumed. However, data with uncertainty is quite natu...
133
click to vote
DEXAW
2006
IEEE
15 years 8 months ago
2006
IEEE
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
132
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
147
click to vote
ISCAPDCS
2003
15 years 3 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...