753 search results - page 3 / 151 » Completing a (k - 1)-Assignment |
DCC
2002
IEEE
14 years 5 months ago
2002
IEEE
We point out an interplay between Fq-Frobenius non-classical plane curves and complete (k, d)-arcs in P2 (Fq). A typical example that shows how this works is the one concerning an ...
ACS
2008
13 years 5 months ago
2008
In this paper, it is shown that any non-M-cosingular -supplemented module M is (D3) if and only if M has the summand intersection property. Let N [M ] be any module such that Z M(...
ENDM
2002
13 years 5 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
DM
2008
13 years 5 months ago
2008
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
IEEEARES
2008
IEEE
14 years 5 days ago
2008
IEEE
k-Anonymity is a privacy property requiring that all combinations of key attributes in a database be repeated at least for k records. It has been shown that k-anonymity alone does...