Sciweavers

4303 search results - page 23 / 861
» Are We There Yet
Sort
View
EUROPAR
2006
Springer
13 years 11 months ago
Implementing Irregular Parallel Algorithms with OpenMP
Writing irregular parallel algorithms with OpenMP has been rarely practised in the past. Yet it is possible, and in this paper we will use a simple breadth
Michael Süß, Claudia Leopold
NGC
2002
Springer
13 years 7 months ago
Chance Discovery and Scenario Analysis
Scenario analysis is often used to identify possible chance events. However, no formal, computational theory yet exists for scenario analysis. In this paper, we commence developme...
Peter McBurney, Simon Parsons
ISMIS
1994
Springer
13 years 11 months ago
BDDs and Automated Deduction
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
Jean Goubault, Joachim Posegga
CRYPTO
2006
Springer
109views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
There are several candidate semantically secure encryption schemes, yet in many applications non-malleability of encryptions is crucial. We show how to transform any semantically s...
Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan
SIGIR
2008
ACM
13 years 7 months ago
A large time-aware web graph
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression
Paolo Boldi, Massimo Santini, Sebastiano Vigna