3616 search results - page 501 / 724 » Conditional Memory Ordering |
128
click to vote
CHES
2010
Springer
15 years 4 months ago
2010
Springer
The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFI...
127
click to vote
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
148
click to vote
JTRES
2010
ACM
15 years 3 months ago
2010
ACM
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
135
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
123
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...