Results 251 to 260 of about 149,052 (280)

Cycle reversals in oriented plane quadrangulations and orthogonal plane partitions

Journal of Geometry, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nakamoto, Atsuhiro, Watanabe, Mamoru
openaire   +1 more source

ORTHOGONAL PARTITIONS OF THE 5 × 5 LATIN SQUARES

Annals of Eugenics, 1946
The articles published by the Annals of Eugenics (1925–1954) have been made available online as an historical archive intended for scholarly use. The work of eugenicists was often pervaded by prejudice against racial, ethnic and disabled groups. The online publication of this material for scholarly research purposes is not an endorsement of those views
openaire   +1 more source

Binary Space Partition for Orthogonal Fat Rectangles

2003
We generate a binary space partition (BSP) of size O(n log8 n) and depth O(n log4 n) for n orthogonal fat rectangles in three-space, improving earlier bounds of Agarwal et al. We also give a lower bound construction showing that the size of an orthogonal BSP for these objects is Ω(n log n) in the worst case.
openaire   +1 more source

Optimal set-partitioning for super-orthogonal space-time trellis codes

Proceedings IEEE International Symposium on Information Theory,, 2003
Space-time trellis codes provide improved error performance for wireless systems using multiple transmit antennas. The authors have shown that such codes can provide full diversity gain as well as additional signal-to-noise ratio (SNR) advantage that they call the coding gain. Code design rules for achieving full diversity are also provided.
H. Jafarkhani, N. Seshadri
openaire   +1 more source

Reducing collisions between bluetoioth piconets by orthogonal hop set partitioning

Radio and Wireless Conference, 2003. RAWCON '03. Proceedings, 2004
This paper proposes a novel orthogonal hop set partitioning (OHSP) scheme aimed at reducing the collisions between piconets at the hop level, by partitioning the original Bluetooth hop band into five orthogonal sub-hop sets. To support OHSP, an orthogonal hop set construction method and enhanced synthesizer structures are presented.
null Zhifeng Jiang, V.C.M. Leung, V.W.S. Wong   +2 more
openaire   +1 more source

The partitioning of an orthogonal group in six variables

Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1958
An orthogonal group of projectivities in six variables is partitioned into 31 disjoint sets; 17 of these constitute a subgroup, of index 2 and order 3265920, isomorphic to a group already known in great detail in another representation. The ambient space is finite, of five dimensions; its points fall into three batches of 126, 126, 112, these last ...
openaire   +1 more source

A Lattice-Partition Framework of Downlink Non-Orthogonal Multiple Access without SIC

GLOBECOM 2017 - 2017 IEEE Global Communications Conference, 2017
In this paper, downlink non-orthogonal multiple access (NOMA) with receivers performing single- user decoding i.e., without successive interference cancellation (SIC) is studied. Using lattice partitions, we generalize the scheme recently proposed by Shieh and Huang [1] to general n-dimensional constellations carved from lattices.
Min Qiu, Yu-Chih Huang, Shin-Lin Shieh, Jinhong Yuan   +3 more
openaire   +1 more source

Orthogonality and Linear Sufficiency in Partitioned and Reduced Linear Models

Communications in Statistics - Theory and Methods, 2011
The partitioned linear model ℳ12 is considered together with the reduced counterparts ℳ2 and ℳ(2), which are free from nuisance parameters present in ℳ12. The conditions are established under which the best linear unbiased estimator of parametric functions in the reduced model ℳ2(ℳ(2)) preserves its optimality in ℳ12.
openaire   +1 more source

Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs

2001
A triangle contact system S is a geometrical object on the plane consisting of finite number of triangular disks {.si, ..., sn} in a triangle ? bounded by three segments A, B and C such that every vertex of each Si coincides with an inner point of either A, B, C or a segment of some Sj.
openaire   +1 more source

RIS Partition-Assisted Non-Orthogonal Multiple Access (NOMA) and Quadrature-NOMA With Imperfect SIC

IEEE Transactions on Wireless Communications, 2023
Ankita Chauhan, Sayantan Ghosh, Anshul Jaiswal   +2 more
exaly