Displaying 741 – 760 of 1507

Showing per page

Modifying the tropical version of Stickel's key exchange protocol

Any Muanalifah, Sergei Sergeev (2020)

Applications of Mathematics

A tropical version of Stickel's key exchange protocol was suggested by Grigoriev and Shpilrain (2014) and successfully attacked by Kotov and Ushakov (2018). We suggest some modifications of this scheme that use commuting matrices in tropical algebra and discuss some possibilities of attacks on these new modifications. We suggest some simple heuristic attacks on one of our new protocols, and then we generalize the Kotov and Ushakov attack on tropical Stickel's protocol and discuss the application...

Modular invariance property of association schemes, type II codes over finite rings and finite abelian groups and reminiscences of François Jaeger (a survey)

Eiichi Bannai (1999)

Annales de l'institut Fourier

Modular invariance property of association schemes is recalled in connection with our joint work with François Jaeger. Then we survey codes over F 2 discussing how codes, through their (various kinds of) weight enumerators, are related to (various kinds of) modular forms through polynomial invariants of certain finite group actions and theta series. Recently, not only codes over an arbitrary finite field but also codes over finite rings and finite abelian groups are considered and have been studied...

Monoides parcialmente aditivos en la teoría de la información.

A. Bahamonde Rionda, J. S. López García (1985)

Stochastica

Partially-additive monoids (pams) were introduced by Arbib and Manes ([1]) in order to provide an algebraic approach to the semantic of recursion in theoretical computer science. Here we extend the range of application of pams for capturing information theory concepts as componibility and sequential continuity, which arise naturally in this framework.

Morphology for Image Processing. Part I

Hiroshi Yamazaki, Czesław Byliński, Katsumi Wasaki (2012)

Formalized Mathematics

In this article we defined mathematical morphology image processing with set operations. First, we defined Minkowski set operations and proved their properties. Next, we defined basic image processing, dilation and erosion proving basic fact about them [5], [8].

MRA super-wavelets.

Bildea, Stefan, Dutkay, Dorin Ervin, Picioroaga, Gabriel (2005)

The New York Journal of Mathematics [electronic only]

Multichannel deblurring of digital images

Michal Šorel, Filip Šroubek, Jan Flusser (2011)

Kybernetika

Blur is a common problem that limits the effective resolution of many imaging systems. In this article, we give a general overview of methods that can be used to reduce the blur. This includes the classical multi-channel deconvolution problems as well as challenging extensions to spatially varying blur. The proposed methods are formulated as energy minimization problems with specific regularization terms on images and blurs. Experiments on real data illustrate very good and stable performance of...

Currently displaying 741 – 760 of 1507