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.
We show that if the nearly-linear time solvers for Laplacian matrices and their generalizations can be extended to solve just slightly larger families of linear systems, then they can be used to quickly solve all systems of linear equations over the reals. This result can be viewed either positively or negatively: either we will develop nearly-linear time algorithms for solving all systems of linear...
Each year more and more people are diagnosed with Diabetes Mellitus. As this disease continues to grow, it will have an enormous effect on society. Recently, a computerized noninvasive diagnostic method was proposed using facial block color features with a sparse representation classifier. This method eliminated the need to extract bodily fluids, and any feelings of pain and discomfort associated...
Discovering top-k influential users plays a central role in many social network applications. In this paper, we study a challenging problem of discovering item-based top-k influential users in social networks. Specifically, we present a dynamic selection approach (referred to as Item-based top-K influential user Discovering Approach, IDA for short), to identify the top-k influential users for a given...
Influence maximization, defined as finding a small subset of nodes that maximizes spread of influence in social networks, is NP-hard under both Linear Threshold (LT) and Independent Cascade (IC) models, where a line of greedy/heuristic algorithms have been proposed. The simple greedy algorithm [14] achieves an approximation ratio of 1-1/e. The advanced CELF algorithm [16], by exploiting the sub modular...
Determination of Ribonucleic Acid structure is challenging, in order to optimize the RNA pseudoknotted structure,the paper investigates the computational problem and complexity of predicting RNA structure. A new computational method and model with minimum free energy are adopted to predict RNA structure. The main contribution of the paper is to achieves an efficient approximation algorithm for finding...
Reliability is a critical concern in the provision and placement of web services. A breakdown of service would seriously reduce customers' satisfaction, and thus harm the revenue of service providers. To maintain a high reliability, the common approach is deploying multiple service instances across different physical servers. This would inevitably raise another concern of energy consumption. Thus,...
Cloud computing provides virtualized, dynamically-scalable computing power. At the same time, reduction of cost is also considered as an important advantage of cloud computing. Data integration can notably benefit from cloud computing because integrating data is usually an expensive task. However, existing optimization techniques pay less attention on the fact that different execution plans of the...
Rough concept lattice (RCL) is a new concept lattice, which can deal with uncertainty knowledge. It is an effective tool for data analysis and knowledge discovery. But some objects that in upper approximation extent of RCL are so uncertainty that makes the accuracy of association rules reduced. In this case, based on decision context, we construct a L- plumpness concept lattice (Lp - RCL), in whose...
Given a tree T = (V, E) with costs defined on edges, a positive integer k, and I terminal sets {S1, S2, . . ., Sl} with every Si sube V, the generalized k-multicut in trees problem (k-GMC(T)) asks to find an edge subset in E at the minimum cost such that its removal cuts at least k terminal sets. The k-GMC(T) problem is a natural generalization of the classical multicut in trees problem and the multiway...
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.