458 search results - page 71 / 92 » Perfect Skolem sets |
104
click to vote
MOC
2002
14 years 11 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
SIAMDM
1998
14 years 11 months ago
1998
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
109
click to vote
IJAR
2010
14 years 10 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
110
click to vote
SMC
2010
IEEE
14 years 10 months ago
2010
IEEE
—Deep Web contents are accessed by queries submitted to Web databases and the returned data records are enwrapped in dynamically generated Web pages (they will be called deep Web...