662 search results - page 92 / 133 » Trees, Automata and XML |
223
click to vote
SACMAT
2009
ACM
16 years 15 days ago
2009
ACM
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
142
click to vote
FOSSACS
2004
Springer
15 years 11 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
143
click to vote
IFSA
2007
Springer
16 years 4 days ago
2007
Springer
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
146
click to vote
ICDM
2006
IEEE
16 years 1 days 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...
189
click to vote
NJC
2006
15 years 6 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...