6299 search results - page 1155 / 1260 » Data and Computation Abstractions for Dynamic and Irregular ... |
156
click to vote
SPIRE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
137
click to vote
CHARME
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We survey the work done so far in the FLaSH project (Functional Languages for Synthesising Hardware) in which the core ideas are (i) using a functional language SAFL to d...
184
click to vote
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
163
click to vote
EUROPAR
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
160
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...