Results 241 to 250 of about 149,052 (280)
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
Partitioning Orthogonal Histograms into Rectangular Boxes
2018The problem of partitioning an orthogonal polyhedron into a minimum number of boxes was shown to be NP-hard in 1991, but no approximability result is known except for a 4-approximation algorithm for 3D-histograms. In this paper we broaden the understanding of the 3D-histogram partitioning problem.
Therese Biedl +5 more
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.
S. Oliveria, T. Soma
openaire +1 more source
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
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
Orthogonal Prediction Configural Frequency Analysis by Chi‐Square Partitioning
Biometrical Journal, 1992AbstractPrediction Configural Frequency Analysis is reconceptualized in terms of orthogonal Chi‐Square decomposition. The predictor‐criterion contingency table is subdivided into fourfold tables. The chisquare components of these tables, calculated using Kimball's shortcut formulas, sum up to the total chi‐square of the r × c table. As a result of this
Erwin Lautsch +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
Orthogonal and Nonorthogonal Methods for Partitioning Regression Variance
American Educational Research Journal, 1971Bottenberg and Ward's (1963) developments of the generalized exploitation of multiple linear regression and of their concept of "independent contributions" of variable sets in regression composites were based on Mood's distinction. Stimulated by these developments, two of their colleagues published a systematic application of the Bottenberg-Ward ...
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.
M.T. Cychowski +2 more
openaire +1 more source
A Fundamental Partition in Models with Commutative Orthogonal Block Structure
AIP Conference Proceedings, 2011Models with commutative orthogonal block structure, COBS, constitute an interesting class of models with orthogonal block structure, OBS, in which the orthogonal projection matrix on the space Ω spanned by the mean vectors commute with the known pairwise orthogonal projection matrices Q1,…, Qm that figure in the expression of the variance‐covariance ...
Francisco Carvalho +7 more
openaire +1 more source