5084 search results - page 257 / 1017 » Proving Possibility Properties |
182
click to vote
LATIN
2004
Springer
15 years 12 months ago
2004
Springer
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
175
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Password-based protocols for authenticated key exchange (AKE) are designed to work despite the use of passwords drawn from a space so small that an adversary might well enumerate, ...
131
click to vote
FMSD
2006
15 years 6 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
174
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
131
click to vote
BPM
2009
Springer
16 years 1 months ago
2009
Springer
Process models are considered to be a major asset in modern business organizations. They are expected to apply to all the possible business contexts in which the process may be exe...