Sciweavers

4542 search results - page 111 / 909
» Design patterns for data structures
Sort
View
121
Voted
ISCA
2009
IEEE
150views Hardware» more  ISCA 2009»
15 years 9 months ago
Stream chaining: exploiting multiple levels of correlation in data prefetching
Data prefetching has long been an important technique to amortize the effects of the memory wall, and is likely to remain so in the current era of multi-core systems. Most prefetc...
Pedro Diaz, Marcelo Cintra
135
Voted
CIKM
2006
Springer
15 years 4 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
103
Voted
ICSE
2005
IEEE-ACM
16 years 2 months ago
Data structure repair using goal-directed reasoning
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
Brian Demsky, Martin C. Rinard
85
Voted
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
15 years 4 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
108
Voted
ICDM
2007
IEEE
122views Data Mining» more  ICDM 2007»
15 years 9 months ago
Zonal Co-location Pattern Discovery with Dynamic Parameters
Zonal co-location patterns represent subsets of featuretypes that are frequently located in a subset of space (i.e., zone). Discovering zonal spatial co-location patterns is an im...
Mete Celik, James M. Kang, Shashi Shekhar