Sciweavers

2546 search results - page 451 / 510
» In support of city exploration
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
16 years 6 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
HPCA
2006
IEEE
16 years 6 months ago
Retention-aware placement in DRAM (RAPID): software methods for quasi-non-volatile DRAM
Measurements of an off-the-shelf DRAM chip confirm that different cells retain information for different amounts of time. This result extends to DRAM rows, or pages (retention tim...
Ravi K. Venkatesan, Stephen Herr, Eric Rotenberg
HPCA
2002
IEEE
16 years 6 months ago
CableS: Thread Control and Memory Management Extensions for Shared Virtual Memory Clusters
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although c...
Peter Jamieson, Angelos Bilas
POPL
2008
ACM
16 years 6 months ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...