2642 search results - page 307 / 529 » Merge-by-Wire: Algorithms and System Support |
154
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
144
click to vote
HPCA
2006
IEEE
16 years 4 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
136
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
134
click to vote
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containmen...
216
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...