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.
Efficient algorithms for mining frequent itemsets are crucial for mining association rules as well as for many other data mining tasks. In this paper, we integrate the merits of the matrix algorithm and Index-BitTableFI algorithm, and design an efficient algorithm for mining the frequent itemsets. In the new algorithm, it may be generated directly some frequent itemsets which do not generate in the...
Let G(V, E) be a simple graph,k (1 les k les Delta + 1) is a positive integer, f is a mapping from V(G) upsi E(G) to {1, 2,..., k} such that foralluu, uw isin E(G), v ne w, f(uv) ne f(uw); foralluv isin E(G), if d(u) = d(v)then C(u) = C(v); we say that f is the adjacent vertex reducible edge-total coloring of G. The maximum number of k is called the adjacent vertex reducible edge-total chromatic number...
For scalability, many side-effect analysis methods choose inclusion-based context-insensitive (IBCI) pointer analysis as their basis. However, such a pointer analysis is known to be imprecise, which often results in over-conservative side-effect sets. In this paper, we present a lightweight approach that exploits lazy access path resolving to improve the precision of side-effect analysis under IBCI...
Finding all the occurrences of a twig query in an XML database is a core operation for efficient evaluation of XML queries. Since every complex twig query consists of linear ones, it is important to handle linear twig queries effectively. In this paper, we propose a novel path-partitioned encoding scheme, and find a holistic solution to match linear twig queries with no structural join. We show that...
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.