Results 291 to 300 of about 1,046,206 (327)

Application of Finite Orthogonal Polynomials to the Thermal Functions of Harmonic Oscillators. I. Reduced Partition Function of Isotopic Molecules

Journal of Chemical Physics, 1968
Jacob Bigeleisen, Takanobu Ishida, Bigeleisen Jacob   +2 more
exaly   +2 more sources

A New Image Compression Algorithm Based on Non-Uniform Partition and U-System

IEEE transactions on multimedia, 2021
JPEG lossy image compression is a still image compression algorithm model that is currently widely used in major network media. However, it is unsatisfactory in the quality of compressed images at low bit rates.
Yumo Zhang, Z. Cai, Gangqiang Xiong
semanticscholar   +1 more source

A strategy for the efficient removal of chlorophenols in petrochemical wastewater by organophilic and aminated silica@alginate microbeads: Taguchi optimization and isotherm modeling based on partition coefficient.

Journal of Hazardous Materials, 2020
Through in situ encapsulation of cetyltrimethylammonium bromide (CTAB) and urea-functionalized SiO2 nanoparticles in alginate hydrogel, two types of new functionalized microbeads, CTAB-SiO2@alginate (organophilic) and urea-SiO2@alginate (aminated), were ...
S. A. Younis, E. A. Motawea, Y. Moustafa, Jechan Lee, Ki‐Hyun Kim   +4 more
semanticscholar   +1 more source

Set-partition methods and orthogonal designs

2010 IEEE International Symposium on Information Theory, 2010
Space-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

2018
The 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, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte   +5 more
openaire   +1 more source

Partition level multiview subspace clustering

Neural Networks, 2019
Multiview clustering has gained increasing attention recently due to its ability to deal with multiple sources (views) data and explore complementary information between different views.
Zhao Kang, Xinjia Zhao, Chong Peng, Hongyuan Zhu, Joey Tianyi Zhou, Xi Peng, Wenyu Chen, Zenglin Xu   +7 more
semanticscholar   +1 more source

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, Daniel, Borcard, David W, Roberts   +2 more
openaire   +2 more sources

Approximate partitioning of 2D objects into orthogonally convex components

Computer Vision and Image Understanding, 2013
A 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, Arindam Biswas 0002, Partha Bhowmick   +2 more
openaire   +1 more source

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

A new result on orthogonal factorizations in networks

Filomat
Let m, n, r, ? and ki (1 ? i ? m) be positive integers satisfying 1 ? n ? m and k1 ? k2 ???? ? km ? (3? ? 1)r ? 1. Let G be a graph, and let H be an m?-subgraph of G and F = {F1, F2,???, Fm} be a (g, f)- factorization of G. If for any partition {A1,A2,???
Sizhong Zhou, Quanru Pan, Yang Xu
semanticscholar   +1 more source