244 search results - page 31 / 49 » Fast Set Intersection in Memory |
ASAP
2008
IEEE
14 years 2 days ago
2008
IEEE
This paper presents a multiprocessor system on FPGA that adopts Direct Memory Access (DMA) mechanisms to move data between the external memory and the local memory of each process...
INFOCOM
2012
IEEE
12 years 15 days 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...
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...
EDBT
2006
ACM
14 years 11 hour ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
LCPC
2001
Springer
14 years 2 months ago
2001
Springer
While uniprocessor garbage collection is relatively well understood, experience with collectors for large multiprocessor servers is limited and it is unknown which techniques best ...