2713 search results - page 132 / 543 » Parameterized Tree Systems |
151
Voted
ICDT
2012
ACM
13 years 6 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
129
click to vote
CADE
2006
Springer
16 years 3 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
144
Voted
CC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
146
Voted
ISNN
2005
Springer
15 years 9 months ago
2005
Springer
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
128
Voted
HICSS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper we shall represent strategic planning problems by dynamic decision trees, in which the nodes are projects that can be deferred or postponed for a certain period of t...