Sciweavers

54 search results - page 3 / 11
» Thanks for the memory
Sort
View
IEEEHPCS
2010
13 years 6 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
14 years 1 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni
CAV
2003
Springer
154views Hardware» more  CAV 2003»
14 years 28 days ago
Structural Symbolic CTL Model Checking of Asynchronous Systems
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model...
Gianfranco Ciardo, Radu Siminiceanu
DAIS
2006
13 years 9 months ago
Using Speculative Push for Unnecessary Checkpoint Creation Avoidance
Abstract. This paper discusses a way of incorporating speculation techniques into Distributed Shared Memory (DSM) systems with checkpointing mechanism without creating unnecessary ...
Arkadiusz Danilecki, Michal Szychowiak
CCS
2007
ACM
14 years 1 months ago
Memsherlock: an automated debugger for unknown memory corruption vulnerabilities
Software vulnerabilities have been the main contributing factor to the Internet security problems such as fast spreading worms. Among these software vulnerabilities, memory corrup...
Emre Can Sezer, Peng Ning, Chongkyung Kil, Jun Xu