1237 search results - page 53 / 248 » Abstract shade trees |
113
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
153
click to vote
CC
2007
Springer
15 years 10 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 ...
139
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
139
click to vote
ICANNGA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
114
click to vote
CRYPTO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and...