10 search results - page 2 / 2 » Maximal Covering by Two Isothetic Unit Squares |
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
—Transmitter-based signal pre-processing is investigated for the two-dimensional (2-D) OFDM-CDMA (orthogonal frequency division multiplexing, code division multiple access) forwa...
DCOSS
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
CCCG
2009
13 years 6 months ago
2009
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
APIN
2006
13 years 5 months ago
2006
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...