Sciweavers

2029 search results - page 352 / 406
» informs 2002
Sort
View
TOIS
2002
97views more  TOIS 2002»
13 years 8 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
TON
2002
82views more  TON 2002»
13 years 8 months ago
On multicast flow control for heterogeneous receivers
In this paper, we study the impact of heterogeneous receivers on the throughput of multicast flow control and propose a new multicast flow control algorithm to optimally partition ...
Rung-Hung Gau, Zygmunt J. Haas, Bhaskar Krishnamac...
TON
2002
123views more  TON 2002»
13 years 8 months ago
Utility-based rate control in the Internet for elastic traffic
In a communication network, a good rate allocation algorithm should reflect the utilities of the users while being fair. We investigate this fundamental problem of achieving the sy...
Richard J. La, Venkat Anantharam
TON
2002
175views more  TON 2002»
13 years 8 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
TOPLAS
2002
89views more  TOPLAS 2002»
13 years 8 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua