906 search results - page 92 / 182 » Matching Subsequences in Trees |
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
ALGORITHMICA
2002
13 years 9 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
This paper describes an offline handwriting recognition system for Amharic words based on lexicon. The system computes direction fields of scanned handwritten documents, from whic...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
PERSUASIVE
2009
Springer
14 years 3 months ago
2009
Springer
This paper outlines eight steps to follow as best practices in the early stages of persuasive technology design. The eight-step process, drawn from demonstrated successes in indus...