906 search results - page 129 / 182 » Matching Subsequences in Trees |
ADC
2008
Springer
13 years 11 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
AAAI
1994
13 years 10 months ago
1994
Conceptual information retrieval systems use structured document indices, domain knowledge and a set of heuristic retrieval strategies to match user queries with a set of indices ...
COMCOM
2010
13 years 9 months ago
2010
A number of IEEE 802.15.4 devices can form a tree topology as proposed by ZigBee specification. The ability to confine the shape and extent of the tree serves as the basis for add...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...