316 search results - page 22 / 64 » Bounded Depth Data Trees |
167
click to vote
INFOCOM
2007
IEEE
16 years 6 days ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
160
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
161
click to vote
WADS
2007
Springer
16 years 11 hour ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
145
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
166
click to vote
KDD
2000
ACM
15 years 9 months ago
2000
ACM
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...