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 give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our distance oracle has size O(n5/3) = O(n1.66⋯) and, when queried about vertices at distance d, returns a path of length 2d + 1. For weighted graphs with m = n2/α edges, our distance oracle has size O(n2/3√α) and returns a factor 2 approximation...
Novel lazy Lauritzen-Spiegelhalter (LS), lazy Hugin and lazy Shafer-Shenoy (SS) algorithms are devised for Gaussian Bayesian networks (BNs). In the lazy algorithms, the clique potentials and separator potentials are kept in combinable decomposed form instead of combined to be a single valuation in conventional junction tree algorithms. By employing decomposed form potentials, the independence relations...
This paper presents a method of automatic acquisition threshold value that changes dynamically with data distribution by polynomial fitting technique. The proposed method overcomes the sensitivity to cluster centers and locality of FCM (fuzzy c-means) algorithm and establishes an index mechanism on the basis of above analysis. Simulations show that the adaptable fuzzy clustering image indexing performs...
In the design of time-critical applications, schedulability analysis can be used to define the feasibility region of tasks so that optimization techniques can find the best design solution that satisfies the deadlines. This method has been applied to obtain the optimal task implementation, priority assignment or placement of tasks onto CPUs in previous work. The definition of the feasibility region...
The maximum throughput of relaying information flows while concealing their presence is studied. The concealment is achieved by embedding transmissions of information flows into truly independent transmission schedules that resemble the normal transmission behaviors without any flow. Such embedding may reduce the throughput for delay-sensitive flows, and the paper provides a quantitative characterization...
Mining sequential patterns in biological data has attracted a great deal of attention in the last couple of years. Biologists are interested in finding the frequent orderly arrangement of motifs that may be responsible for similar expression of a group of genes. The size of the output space can be greatly reduced if only the maximal frequent patterns are reported. In this paper we present maximal...
Precise information of MAC layer topology is important for both network management and network analysis. There are many topology discovery algorithms based on the address forwarding tables but they supposed that the network to discovery hasn't redundant links or these algorithms are not effective to discover redundant links. In this paper, we present algorithms based on address forwarding tables (AFT)...
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.