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

Capacity and Efficiency of Decision Functions

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

1 Author(s)
Bitner, J.R. ; Department of Computer Science, University of Texas

Two criteria for comparing the performance of dedision functions are discussed. The first is the capacity as defined by Cover. We extend his definition to allow the calculation of the capacity of hyperboxes (interval complexes), which are shown to have asymptotically lower capacity than hyperplanes. The second criterion is the efficiency. We calculate the efficiency for polynomial functions. The efficiency sharply decreases as the degree of the polynomial increases. This calculation is also done for hyperboxes, which are shown to be more efficient than hyperplanes.

Published in:

Computers, IEEE Transactions on  (Volume:C-26 ,  Issue: 11 )