1079 search results - page 29 / 216 » An Implementation of an Address Generator Using Hash Memorie... |
NA
2010
13 years 7 months ago
2010
We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like. Moreover, this new algorithm...
CAL
2010
13 years 6 months ago
2010
Address translation often emerges as a critical performance bottleneck for virtualized systems and has recently been the impetus for hardware paging mechanisms. These mechanisms ap...
CN
2008
13 years 9 months ago
2008
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
ICOIN
2003
Springer
14 years 2 months ago
2003
Springer
Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering...
INFOCOM
2012
IEEE
11 years 11 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...