Results 281 to 290 of about 1,046,206 (327)

An orthogonal partition selection strategy for the sampling of graph signals with successive local aggregations

Signal Processing, 2021
Guangrui Yang, Lihua Yang, Chao Huang
exaly   +2 more sources

Models with homoscedastic orthogonal partition, BQUE and mixed models

AIP Conference Proceedings, 2013
We 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   +2 more sources

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

Global Communications Conference, 2017
Min Qiu, Yu-Chih Huang, Shin-Lin Shieh   +2 more
exaly   +2 more sources

Orthogonal Least Squares in Partition of Unity Surface Reconstruction with Radial Basis Function

Geometric Modeling and Imaging, 2006
In this paper, a least squares formulation with radial basis function for surface reconstruction is presented and OLS (Orthogonal Least Squares) algorithm is proposed to select centers and eliminate numerical ill-conditioning.
Qi Xia, M. Wang, Xiaojun Wu
semanticscholar   +2 more sources

THE USE OF ORTHOGONAL POLYNOMIALS IN THE PARTITION OF CHI‐SQUARE

Australian Journal of Statistics, 1961
P. Claringbold
openaire   +3 more sources

Efficient Orthogonal Multi-view Subspace Clustering

Knowledge Discovery and Data Mining, 2022
Multi-view subspace clustering targets at clustering data lying in a union of low-dimensional subspaces. Generally, an n X n affinity graph is constructed, on which spectral clustering is then performed to achieve the final clustering.
Mansheng Chen, Changdong Wang, Dong Huang, J. Lai, Philip S. Yu   +4 more
semanticscholar   +1 more source

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 ...
John Hershberger 0001, Subhash Suri, Csaba D. Tóth   +2 more
openaire   +1 more source

Multi-View Clustering via Nonnegative and Orthogonal Graph Reconstruction

IEEE Transactions on Neural Networks and Learning Systems, 2021
The goal of multi-view clustering is to partition samples into different subsets according to their diverse features. Previous multi-view clustering methods mainly exist two forms: multi-view spectral clustering and multi-view matrix factorization ...
Shaojun Shi, F. Nie, Rong Wang, Xuelong Li   +3 more
semanticscholar   +1 more source

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.
Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood   +2 more
openaire   +1 more source

A study of orthogonal array-based designs under a broad class of space-filling criteria

Annals of Statistics, 2022
Space-filling designs based on orthogonal arrays are attractive for computer experiments for they can be easily generated with desirable low-dimensional stratification properties.
Guanzhou Chen, Boxin Tang
semanticscholar   +1 more source