31 search results - page 5 / 7 » On Balls and Bins with Deletions |
CAEPIA
2007
Springer
14 years 1 months ago
2007
Springer
Consider a robot whose task is to pick up some colored balls from a grid, taking the red balls to a red spot, the blue balls to a blue spot and so on, one by one, without knowing e...
SIAMCOMP
1998
13 years 7 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—In this paper, we analyze three opportunistic multichannel MAC protocols that associate a newcoming terminal station to one of the access points available within its tra...
BMCBI
2004
13 years 7 months ago
2004
Background: Microarray-based comparative genome hybridization experiments generate data that can be mapped onto the genome. These data are interpreted more easily when represented...