Cart (Loading....) | Create Account
Close category search window
 

Matrix approach to the problem of matrix partitioning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Stasevich, S.I. ; Council for Cybern., Acad. of Sci., Moscow, Russia ; Koshelev, V.N.

We derive upper and lower bounds on the number of all variants a rectangular M×N matrix can be partitioned into fragments. Next the problem of matrix partitioning is considered as a particular example of a more general problem of constructing two-dimensional Markov processes (fields) on discrete rectangular lattices. We discuss a matrix-theoretical approach to the problem to explore the structure of discrete fields defined by a given matrix of local interaction

Published in:

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Date of Conference:

17-22 Sep 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.