27 search results - page 3 / 6 » ejc 2000 |
EJC
2000
13 years 7 months ago
2000
EJC
2000
13 years 7 months ago
2000
EJC
2000
13 years 7 months ago
2000
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.
EJC
2008
13 years 7 months ago
2008
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
EJC
2000
13 years 8 months ago
2000
Abstract: The concept of information is still lacking a complete understanding, as witnessed by the large number of different meanings that overload the terms "data", &qu...