On the Non-Redundant Representation of the Minimax Basis of Strong Associations

Prikladnaya Diskretnaya Matematika - Russian Federation
doi 10.17223/20710410/36/9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

On the Strong Uniqueness of Highly Sparse Representations From Redundant Dictionaries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

On the Non-Redundant Roles Of TDO2 and IDO1

Frontiers in Immunology
AllergyImmunology
2014English

Representation of Information About Part on the Basis of Its Engineering Features

International Journal of Innovative Technology and Exploring Engineering
Mechanics of MaterialsElectronic EngineeringCivilStructural EngineeringElectricalComputer Science
2019English

The Strong Radical and the Left Regular Representation

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1987English

Complex Representation of Natural Heritage on the Basis of WebGL. Shushensky Bor Information System

Journal of Siberian Federal University - Humanities and Social Sciences
Anthropology
2018English

Rethinking Representation: The Challenge of Non-Humans

Australian Journal of Political Science
SociologyPolitical Science
2014English

Strong Identifiability and Optimal Minimax Rates for Finite Mixture Estimation

Annals of Statistics
UncertaintyStatisticsProbability
2018English

The NonCode aReNA DB: A Non-Redundant and Integrated Collection of Non-Coding RNAs

EMBnet.journal
2015English

Library of Molecular Associations: Curating the Complex Molecular Basis of Liver Diseases

BMC Genomics
BiotechnologyGenetics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy