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.
According to existing have defects discernibility matrix, and the attribute reduction algorithm for attribute reduction algorithm of complex process. This paper made part of optimization, based on the condition attributes classify the grouping generated representative data to simplify the discernibility matrix, and the order of the discernibility matrix, and the complexity of the attribute reduction...
To reduce the computational burden of the nearest neighbor search (NNS) problem, most existing algorithms focus on `preprocessing' the data set to reduce the number of objects to be examined for each querying operation (e.g., efficient data structures, metric space transforms). In this paper we present a quantization based nearest-neighbor-preserving metric approximation algorithm (QNNM) that leads...
We propose an automatic approximation of the intrinsic manifold for general semi-supervised learning problems. Unfortunately, it is not trivial to define an optimization function to obtain optimal hyperparameters. Usually, pure cross-validation is considered but it does not necessarily scale up. A second problem derives from the suboptimality incurred by discrete grid search and overfitting problems...
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an initial bundle. At an ldquoequilibriumrdquo set of prices for goods, if each individual buyer separately ex-changes the initial bundle for an optimal bundle at the set prices, the market clears, i.e., all goods are exactly consumed...
Attribute reduction is a very important part of rough set theory. However, the cost of reduct computation is highly influenced by the size of object set and attribute set, so enhancing the reduct computation efficiency is one of the major problems. This paper proposes a reduction algorithm capable of reducing the time cost by using the binary discernibility matrix. Based on analyzing the binary discernibility...
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization procedure for finding unitary space-time signal constellations...
In this paper, we propose a cross-layer optimization approach that exploits retransmission diversity in wireless CDMA communications. Conventionally, data packets that are not correctly detected are usually dropped. These dropped packets can be used to help data packet detection. By exploiting all the retransmitted packets, data packets can be correctly detected with higher probability. The proposed...
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.