System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Scanning and prediction in multi-dimensional data arrays

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)
Merhav, N. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Weissman, T.

The problem of sequentially scanning and predicting data arranged in a multi-dimensional array is considered. We introduce the notion of a scandictor, which is any scheme for the sequential scanning and prediction of such data. The scandictability of a probabilistic data-array is defined as the best achievable expected "scandiction" performance on that array. We derive a lower bound on scandiction performance that is shown to be tight for various cases of interest.

Published in:

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

Date of Conference:

2002