594 search results - page 7 / 119 » A Note on Concepts and Distances |
COMBINATORICA
2010
13 years 5 months ago
2010
Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds' theorem on disjoint spanning branchin...
ICISC
2007
13 years 9 months ago
2007
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...
OL
2010
13 years 6 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We address the problem of providing a logical characterization of reasoning based on stereotypes. Following [6] we take a semantic perspective and we base our model on a ...
SACRYPT
1999
Springer
13 years 12 months ago
1999
Springer
We describe the design of Yarrow, a family of cryptographic pseudo-random number generators (PRNG). We describe the concept of a PRNG as a separate cryptographic primitive, and the...