Sciweavers

256 search results - page 41 / 52
» A New Synchronous Lower Bound for Set Agreement
Sort
View
JPDC
2008
135views more  JPDC 2008»
13 years 7 months ago
Fast parallel GPU-sorting using a hybrid algorithm
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
Erik Sintorn, Ulf Assarsson
EUROCRYPT
2001
Springer
14 years 7 days ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
14 years 1 months ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
TIT
2002
107views more  TIT 2002»
13 years 7 months ago
Constrained systems with unconstrained positions
We develop methods for analyzing and constructing combined modulation/error-correctiong codes (ECC codes), in particular codes that employ some form of reversed concatenation and w...
Jorge Campello de Souza, Brian H. Marcus, Richard ...
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu