3 search results - page 1 / 1 » Minimal blocking sets in PG(2, 9) |
ARSCOM
2008
13 years 11 months ago
2008
We classify the minimal blocking sets of size 15 in PG(2, 9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the u...
ARSCOM
2008
13 years 11 months ago
2008
We prove the non-existence of maximal partial spreads of size 76 in PG(3, 9). Relying on the classification of the minimal blocking sets of size 15 in PG(2, 9) [22], we show that ...
MICRO
2006
IEEE
14 years 4 months ago
2006
IEEE
The large working sets of commercial and scientific workloads stress the L2 caches of Chip Multiprocessors (CMPs). Some CMPs use a shared L2 cache to maximize the on-chip cache c...