3020 search results - page 84 / 604 » Optimal partition trees |
158
Voted
USS
2004
15 years 7 months ago
2004
Privilege separation partitions a single program into two parts: a privileged program called the monitor and an unprivileged program called the slave. All trust and privileges are...
177
Voted
WADS
2007
Springer
16 years 6 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
157
Voted
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
170
click to vote
ENTCS
2008
15 years 6 months ago
2008
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
200
click to vote
TCS
2008
15 years 6 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...