Results 121 to 130 of about 6,993 (154)

One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics

Neural Computation, 2007
According to the proof by Liu, Chiu, and Xu (2004) on the so-called one-bit-matching conjecture (Xu, Cheung, and Amari, 1998a), all the sources can be separated as long as there is an one-to-one same-sign correspondence between the kurtosis signs of all source probability density functions (pdf's) and the kurtosis signs of all model pdf's, which is ...
openaire   +3 more sources

SU(3)×𝒮₂₀ algebras for uniform spin‐1 ensembles on [²H¹²C]₂₀, or [¹⁴N]₂₀, dodecahedrane‐type lattices and analogous isotopomeric [M₂₀¹²C₄₀] met‐carb subensembles: M‐based cardinalities and completeness of 𝒮₂₀ spin irreps, via hierarchical {𝒞^{λ⊢(n=20):(M)}} designs of polyhedral combinatorics*

International Journal of Quantum Chemistry, 2002
AbstractThe M‐based hierarchy cardinalities of spin irreps for \documentclass{article}\pagestyle{empty}\begin{document}$[A]_{20}^{(I_{i}=1)}$\end{document} uniform nuclear magnetic resonance (NMR) /isotopomer spin ensembles are derived. Such ideas define the completeness of the number‐partition‐based (intermediate) combinatorial designs (on M ...
openaire   +1 more source

Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations

1998
For the classical quadratic assignment problem (QAP) that requires n objects to be assigned to n locations (the n × n-case), polyhe- dral studies have been started in the very recent years by several authors. In this paper, we investigate the variant of the QAP, where the number of locations may exceed the number of objects (the m × n-case).
openaire   +1 more source

Integrated Portable Shrimp-Freshness Prediction Platform Based on Ice-Templated Metal–Organic Framework Colorimetric Combinatorics and Deep Convolutional Neural Networks

ACS Sustainable Chemistry and Engineering, 2021
Zi Teng, Yaguang Luo, Cheng Gong
exaly  

Recent Advances in Polyhedral Combinatorics

2018
Combinatorial optimization searches for an optimal object in a nite collection; typically the collection has a concise representation while the number of objects is huge. Polyhedral and linear programming techniques have proved to be very powerful and successful in tackling various combinatorial optimization problems, and the end products of these ...
openaire   +3 more sources

Symmetry, Combinatorics, Artificial Intelligence, Music and Spectroscopy

Symmetry, 2021
Krishnan Balasubramanian
exaly  

Portable Food‐Freshness Prediction Platform Based on Colorimetric Barcode Combinatorics and Deep Convolutional Neural Networks

Advanced Materials, 2020
Ting Wang, Jianwu Wang, Ming Wang
exaly  

Polyhedral Combinatorics

2005
Robert D. Carr, Goran Konjevod
openaire   +1 more source

Liquid Metal Combinatorics toward Materials Discovery

Advanced Materials, 2023
Wei Rao
exaly  

Tilting theory and cluster combinatorics

Advances in Mathematics, 2006
Aslak Bakke Buan, Bethany Rose Marsh, Gordana Todorov   +2 more
exaly