Sciweavers

605 search results - page 93 / 121
» Parameterized Dynamic Tables
Sort
View
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
15 years 5 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
72
Voted
ISCA
2008
IEEE
92views Hardware» more  ISCA 2008»
15 years 5 months ago
Counting Dependence Predictors
Modern processors rely on memory dependence prediction to execute load instructions as early as possible, speculating that they are not dependent on an earlier, unissued store. To...
Franziska Roesner, Doug Burger, Stephen W. Keckler
FOCS
2007
IEEE
15 years 5 months ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin
ICDCSW
2007
IEEE
15 years 4 months ago
UBCA: Utility-Based Clustering Architecture for Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are currently used in a variety of applications. File sharing applications and ad hoc networking have fueled the usage of these systems. P2P systems gen...
Brent Lagesse, Mohan Kumar
IEEEPACT
2007
IEEE
15 years 4 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson