Sciweavers

741 search results - page 93 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
CIKM
2005
Springer
15 years 7 months ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan
ICCS
2001
Springer
15 years 6 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
TOIS
2002
97views more  TOIS 2002»
15 years 1 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ASPLOS
2004
ACM
15 years 7 months ago
Secure program execution via dynamic information flow tracking
Dynamic information flow tracking is a hardware mechanism to protect programs against malicious attacks by identifying spurious information flows and restricting the usage of sp...
G. Edward Suh, Jae W. Lee, David Zhang, Srinivas D...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 2 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel