1871 search results - page 132 / 375 » The Ephemeral Pairing Problem |
96
Voted
SPIRE
2009
Springer
15 years 4 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 ...
DGCI
2006
Springer
15 years 3 months ago
2006
Springer
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
87
Voted
CP
2005
Springer
15 years 5 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
100
click to vote
PODC
2009
ACM
16 years 6 days ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
133
click to vote
CISC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using sym...