Sciweavers

429 search results - page 64 / 86
» Transactional memory
Sort
View
ICCSA
2010
Springer
13 years 11 months ago
An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services
The purpose of this paper is to realize an authentication system which satisfies four requirements for security, privacy protection, and usability, that is, impersonation resistanc...
Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Ke...
PPOPP
2012
ACM
12 years 5 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
PDP
2006
IEEE
14 years 3 months ago
Comparing Commodity SMP System Software with a Matrix Multiplication Benchmark
Commodity symmetric multiprocessors (SMPs), though originally intended for transaction processing, because of their availability, are now used for numerical analysis applications ...
Georgios Tsilikas, Martin Fleury
FIMI
2003
123views Data Mining» more  FIMI 2003»
13 years 11 months ago
Apriori, A Depth First Implementation
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
Walter A. Kosters, Wim Pijls
SBACPAD
2007
IEEE
143views Hardware» more  SBACPAD 2007»
14 years 4 months ago
A Code Compression Method to Cope with Security Hardware Overheads
Code Compression has been used to alleviate the memory requirements as well as to improve performance and/or minimize energy consumption. On the other hand, implementing security ...
Eduardo Wanderley Netto, Romain Vaslin, Guy Gognia...