Sciweavers

19 search results - page 4 / 4
» Unbounded page-based transactional memory
Sort
View
ADC
2008
Springer
156views Database» more  ADC 2008»
14 years 22 days ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
MICRO
2008
IEEE
118views Hardware» more  MICRO 2008»
14 years 24 days ago
Notary: Hardware techniques to enhance signatures
Hardware signatures have been recently proposed as an efficient mechanism to detect conflicts amongst concurrently running transactions in transactional memory systems (e.g., Bulk...
Luke Yen, Stark C. Draper, Mark D. Hill
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 6 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
ICFP
2009
ACM
14 years 7 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...