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 this paper, we aim to capture dependency among high correlated attributes in a sliding window of data streams at any time. Naive solutions cannot address combinatorial explosion problems. In order to generate highly correlated sets, we propose a candidate-generation rule based on Jaccard distance, and a generation method based on min-hashing functions to estimate the Jaccard distance without requiring...
To improve the efficiency of information retrieval in P2P networks, there have been many researches on categorizing data items and clustering peers. In almost all these researches, the number of categories and the policy of categorization are predetermined and static. However, users' requirements for information retrieval dynamically change. This leads to undesired increase of network traffic. In...
As MPEG standards prevail, the opportunities to handle MPEG compressed videos increase, and the video indexing and management that can directly process the compressed videos become important. MPEG video coding standards use motion compensation to compress video data, and the motion compensation generates motion vectors that contain motion information similar to optical flows between regions in different...
The 3-vertex-connectivity augmentation problem of a graph with degree constraints, 3VCA-DC, is defined as follows: ldquoGiven an undirected graph G = (V,E), and an upper bound f(v) isin Z+ cup {infin} on vertex-degree increase for each v isin V, find a smallest set E' of edges such that (V,E cup E') is 3-vertex-connected and such that vertex-degree increase of each v isin V by the addition of E' to...
Three bits per cell NAND Flash Memory Technology for 30 nm and beyond has been successfully developed with floating gate technology. Tight natural Vth distribution, wide program/erase window, and good cell reliability such as program disturb, endurance and data retention are obtained. 8 level Vth distributions are successfully demonstrated.
A floating gate NAND flash memory technology for 30 nm and beyond has been successfully developed. Wide program/erase window, tight natural threshold voltage (Vth) distribution, and good cell reliabilities such as program disturb, program/erase endurance and data retention are successfully demonstrated, which are essential to realize super MLC.
In order to realize intelligent agent such as autonomous mobile robots, reinforcement learning is one of necessary techniques in behavior control system. However, applying the reinforcement learning to actual sized problem, the ldquocurse of dimensionalityrdquo problem in partition of sensory states should be avoided maintaining computational efficiency. Furthermore the robot task is desired to be...
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.