Results 231 to 240 of about 149,052 (280)

Binary space partitions of orthogonal subdivisions

Proceedings of the twentieth annual symposium on Computational geometry, 2004
Summary: We consider the problem of constructing Binary Space Partitions (BSPs) for orthogonal subdivisions (space-filling packings of boxes) in \(d\)-space. We show that a subdivision with \(n\) boxes can be refined into a BSP of size \(O(n^{(d+1)/{3}})\) for all \(d \geq 3\) and that such a partition can be computed in time \({O(K\log n)}\), where ...
Hershberger, John   +2 more
openaire   +1 more source

Construction of Asymmetric Orthogonal Arrays of Strength <i>t</i> from Orthogonal Partition of Small Orthogonal Arrays

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2018
Shanqi PANG, Xiao LIN, Jing WANG
openaire   +3 more sources

Variation partitioning involving orthogonal spatial eigenfunction submodels

Ecology, 2012
When 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

Partitioning and separating sets of orthogonal polygons

Information Sciences, 1987
A geometrical object in the plane is said to be orthogonal if its edges are either vertical or horizontal. A polygon is called orthoconvex if for every vertical-or-horizontal segment, its two endpoints lying in the polygon implies the whole segment lying in the polygon.
Ottmann, Thomas   +2 more
openaire   +1 more source

Orthogonal Partitions in Designed Experiments

Designs, Codes and Cryptography, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Scheduling parallel implementations of partitioned orthogonal transformations

SPIE Proceedings, 1992
Orthogonal 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

Home - About - Disclaimer - Privacy