507 search results - page 64 / 102 » Sizes of Ordered Decision Trees |
INFOCOM
2007
IEEE
14 years 2 months 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...
SSDBM
2002
IEEE
14 years 22 days ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
ISPD
1997
ACM
14 years 6 hour ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- Providing real-time voice multicasting over multihop ad hoc wireless networks is a challenging task. The unique characteristics of voice traffic (viz. small packet size,...
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...