4674 search results - page 195 / 935 » cases 2008 |
183
click to vote
CCR
1999
15 years 6 months ago
1999
In this paper a `fair' key generation and certification protocol for Diffie-Hellman keys is proposed, which is intended for use in cases where neither User nor CA are trusted...
132
click to vote
COMCOM
1999
15 years 6 months ago
1999
If a test does not produce the expected output, the incorrect output may have been caused by an earlier state transfer failure. Ghedamsi and von Bochmann [1992] and Ghedamsi et al...
174
click to vote
DAM
1999
15 years 6 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
147
click to vote
DCG
1999
15 years 6 months ago
1999
Monotone path polytopes arise as a special case of the construction of fiber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, whic...
167
click to vote
SIAMDM
2002
15 years 6 months ago
2002
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...