373 search results - page 5 / 75 » Counting in Trees for Free |
CAI
2007
Springer
14 years 2 months ago
2007
Springer
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
IDEAS
2008
IEEE
14 years 3 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
IWMM
2000
Springer
14 years 4 days ago
2000
Springer
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...