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.
In High Efficiency Video Coding (HEVC), optimal coding unit (CU) size is decided based on recursive rate-distortion cost comparison, which consumes high computational resources. In this paper, an effective HEVC intra CU size decision algorithm is proposed to speed up the encoding process. The algorithm is based on progressive Bayesian classification, which is composed of two cascade classifiers: a...
Rendezvous is a fundamental operation for cognitive users to establish communication links so as to realize data communications and network management. Most of existing rendezvous algorithms implicitly assume that each cognitive user is equipped with one radio, i.e., one wireless transceiver. As the cost of wireless transceivers is dropping, it becomes economically feasible to utilize multiple radios...
HEVC achieves much higher coding efficiency compared with previous coding standards at cost of significant computation complexity. In this paper, an improved Bayesian classification framework is constructed to accelerate the coding unit size decision for HEVC intra coding. Under this framework, different decision mechanisms are applied for different regions of feature space. Specifically, the feature...
Mining of association rules is an important problem in data mining, given a large set of data, extracting frequent item sets in this set is a challenging job in data mining. Item sets matching is the chief problem in extracting frequent item sets. And item set matching is the bottleneck of the mining process. It also has been proved that extracting frequent free item sets is a useful method. Many...
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.