Sciweavers

3341 search results - page 549 / 669
» Managing a Large
Sort
View
131
Voted
HPCA
2009
IEEE
16 years 4 months ago
Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
Eiman Ebrahimi, Onur Mutlu, Yale N. Patt
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 4 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
KDD
2008
ACM
164views Data Mining» more  KDD 2008»
16 years 4 months ago
Microscopic evolution of social networks
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
Jure Leskovec, Lars Backstrom, Ravi Kumar, Andrew ...
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
16 years 4 months ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 4 months ago
Relational data pre-processing techniques for improved securities fraud detection
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
Andrew Fast, Lisa Friedland, Marc Maier, Brian Tay...