Sciweavers

SIAMCOMP
2012
12 years 1 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
SWAT
2000
Springer
114views Algorithms» more  SWAT 2000»
14 years 3 months ago
Maintaining Center and Median in Dynamic Trees
Abstract. We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node and edge weights may be changed. All update...
Stephen Alstrup, Jacob Holm, Mikkel Thorup
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 5 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck
ICDCN
2009
Springer
14 years 6 months ago
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
Amos Korman
ECCV
2002
Springer
15 years 1 months ago
Dynamic Trees: Learning to Model Outdoor Scenes
Abstract. This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or ...
Nicholas J. Adams, Christopher K. I. Williams