A lattice-based minimal partial realization algorithm for matrix sequences of varying length

Author： Wang Li-Ping  

Publisher： Springer Publishing Company

ISSN： 1936-2447

Source： Cryptography and Communications, Vol.3, Iss.1, 2011-03, pp. : 29-42

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

A Lattice-Based Minimal Gray-Scale Switching Algorithm for Obtaining the Optimal Increasing Filter from the Optimal Filter

By Dougherty Edward R.  

Journal of Mathematical Imaging and Vision, Vol. 21, Iss. 1, 2004-07 ,pp. : 43-52

Springer Publishing Company

Access to resources Recommend Favorite

Lattice‐based obfuscation for re‐encryption functions

By  

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 9, 2015-06 ,pp. : 1648-1658

John Wiley & Sons Inc

Access to resources Recommend Favorite

Lattice-Based High-Dimensional Gaussian Filtering and the Permutohedral Lattice

By Baek Jongmin  

Journal of Mathematical Imaging and Vision, Vol. 46, Iss. 2, 2013-06 ,pp. : 211-237

Springer Publishing Company

Access to resources Recommend Favorite

Packing unequal circles into a strip of minimal length with a jump algorithm

By Stoyan Yu.   Yaskov G.  

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 949-970

Springer Publishing Company

Access to resources Recommend Favorite

A Lattice-Based Method for Pricing Electricity Derivatives Under the Threshold Model

By Geman Helyette   Kourouvakalis Stelios  

Applied Mathematical Finance, Vol. 15, Iss. 5-6, 2008-01 ,pp. : 531-567

Routledge Ltd

Access to resources Recommend Favorite