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 Wyner-Ziv video coding (WZVC), the majority of the computational complexity has been shifted from encoder to the decoder in comparison to its conventional video coding technologies. This paper presents a low-complexity frame/block motion activity classification algorithm for WZVC. Improved rate-distortion performance is achieved by adjusting the coding mode of key frame according to the motion...
Discernibility matrix method is an important method to design algorithm for computing the core based on information entropy. In this method, the core is found by discovering all discernibility elements of discernibility matrix. So this method is very time consuming. To improve the efficient of computing the core based on information entropy, the core of the simplified decision which is the same as...
Designing efficient algorithm for computing the core of decision table is a very meaningful work because the core is the foundation of constructing attribute reduction of the decision table and multi-variable decision tree. To improve the efficiency of the algorithm for computing the core based on Skowron's discernibility matrix, simplified decision table and the definition of the core based the Skowron's...
Resource discovery is a key component of P2P network. The resource discovery algorithm complexities of classic models, such as Chord and Pastry, are always equal or even bigger than O(logN), which means while the network scale increasing, the time delay will also increase rapidly without a ceiling. In this paper, we present a new P2P network model for resource discovery. Firstly, we take location-aware...
Community structure is an important property of networks. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However all these algorithms can work well only with small or moderate networks with vertexes of order 10/sup 4/. Additionally, all existing algorithms are off-line...
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.