316 search results - page 17 / 64 » Bounded Depth Data Trees |
184
click to vote
SIAMCOMP
2012
13 years 8 months ago
2012
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...
155
click to vote
COMCOM
2006
15 years 6 months ago
2006
In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario wher...
156
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
144
click to vote
DMKD
2003
ACM
15 years 11 months ago
2003
ACM
HTML anchors are often surrounded by text that seems to describe the destination page appropriately. The text surrounding a link or the link-context is used for a variety of tasks...
133
click to vote
CGF
2004
15 years 5 months ago
2004
In the paper, a new method for modelling trees at medium detail is presented. The method is based on a volumetric representation of trees, generated by an iterated function system...