1237 search results - page 92 / 248 » Abstract shade trees |
151
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
254
click to vote
VLDB
2005
ACM
16 years 5 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
149
click to vote
ATVA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
143
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
151
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...