On the &unknown; 1 Procrustes problem

Author： Trendafilov N.T.  

Publisher： Elsevier

ISSN： 0167-739X

Source： Future Generation Computer Systems, Vol.19, Iss.7, 2003-10, pp. : 1177-1186

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On interpretation of indistinguishability in the problem of interval estimation of unknown probability

By Gusev L.  

Automation and Remote Control, Vol. 71, Iss. 8, 2010-08 ,pp. : 1540-1549

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the multiplicative complexity of Boolean functions over the basis (&unknown;,&unknown;,1)

By Boyar J.   Peralta R.   Pochuev D.  

Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. : 43-57

Elsevier

Access to resources Recommend Favorite

Backtracking Problem in the Traversal of an Unknown Directed Graph by a Finite Robot

By Bourdonov I. B.  

Programming and Computer Software, Vol. 30, Iss. 6, 2004-11 ,pp. : 305-322

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

(1+&unknown;)-Approximation of sorting by reversals and transpositions

By Eriksen N.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 517-529

Elsevier

Access to resources Recommend Favorite

Comparison of &unknown; ~ -norm and &unknown; 1 -norm optimization criteria for SIR-balanced multi-user beamforming

By Schubert M.   Boche H.  

Signal Processing, Vol. 84, Iss. 2, 2004-02 ,pp. : 367-378

Elsevier

Access to resources Recommend Favorite