Results 221 to 230 of about 11,419 (259)
Some of the next articles are maybe not open access.
Set-partition methods and orthogonal designs
2010 IEEE International Symposium on Information Theory, 2010Space-time block codes based on orthogonal designs are useful from practical point of view as these codes admit symbol-by-symbol maximum-likelihood decoding and also achieve full diversity. Though the square orthogonal designs have been studied quite extensively, there is very little progress in the area of non-square orthogonal designs.
openaire +1 more source
Variation partitioning involving orthogonal spatial eigenfunction submodels
Ecology, 2012When partitioning the variation of univariate or multivariate ecological data with respect to several submodels of spatial eigenfunctions (e.g., Moran's eigenvector maps, MEM) acting as explanatory data, a problem occurs: although the submodels are constructed to be orthogonal to one another, the partitioning based on adjusted R2 statistics produces ...
Pierre, Legendre +2 more
openaire +2 more sources
Approximate partitioning of 2D objects into orthogonally convex components
Computer Vision and Image Understanding, 2013A fast and efficient algorithm to obtain an orthogonally convex decomposition of a digital object is presented. The algorithm reports a sub-optimal solution and runs in O(nlogn) time for a hole-free object whose boundary consists of n pixels. The decomposition algorithm can, in fact, be applied on any hole-free orthogonal polygon; in our work, it is ...
Mousumi Dutt +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, 1958Abstract 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,
openaire +1 more source
Scheduling parallel implementations of partitioned orthogonal transformations
SPIE Proceedings, 1992Orthogonal matrix transformations form an important part of matrix-based signal processing applications. Systolic arrays for computing these algorithms have been developed and the size of these arrays usually depends directly on the size of the problem.
Prashanth Kuchibhotla, Bhaskar D. Rao
openaire +1 more source
Computer simulation of the partitioning by mutually orthogonal lines
2019 IEEE 15th International Conference on the Experience of Designing and Application of CAD Systems (CADSM), 2019The partitioning problem of areas into regions along mutually orthogonal lines is considered. A mathematical model of the problem has been proposed, taking into account economic, agrotechnical and fire prevention restrictions. A method has been developed for obtaining a local-optimal partition of a given region based on the construction of two ...
Valentina Komyak +6 more
openaire +1 more source
Binary Space Partition for Orthogonal Fat Rectangles
2003We 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
New partitioning schemes for parallel modified Gram-Schmidt orthogonalization
Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97), 2002In this paper we are concerned with parallel implementation of row-oriented Gram-Schmidt orthogonalization. For the data partitioning four types of columnwise partitioning schemes were considered: column (1-col), block, cyclic and block-cyclic (b-c) partitioning.
Suely Oliveira, Takako Soma
openaire +1 more source
An Orthogonal Partitioning Approach to Simplify Robust Model Predictive Control
Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005., 2005The main limitation of many robust model predictive control (MPC) algorithms is the formidable on-line computational complexity. For linear discrete-time systems with a polytopic uncertainty description, a new efficient algorithm to determine an approximate explicit state feedback solution to robust MPC is developed.
Marcin T. Cychowski +2 more
openaire +1 more source
Models with homoscedastic orthogonal partition, BQUE and mixed models
AIP Conference Proceedings, 2013We consider models with homocedastic orthogonal partitions, such that each variance components is segregated into an orthogonal partition of Rm. By aproaching the estimators for the variance components and the analysis of mixed models, we intend to complete the study of uniformly best linear unbiased estimators (UBLUE) within these models.
Francisco Carvalho, Ricardo Covas
openaire +1 more source