The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The possibility and the construction of a number of fast algorithms for the two-dimensional masking of small mask sizes is clearly demonstrated. These are based on nesting and represent extension of the ideas of Stasinski (1990). Moreover, the authors explain how to make the optimal choice of the algorithm depending on the computational machine available.<<ETX>>
Solutions to matching problems need to be found for assignment and representation, for example, in certain source coding using a variation of vector quantisation. A theorem is presented, in linear independence, which simplifies the checking of the existence, and the determination, of a solution with minimum 'cost' in L/sub infinity /-norm.<<ETX>>
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.