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.
Finding a good partition of a computational directed acyclic graph associated with an algorithm can help find an execution pattern improving data locality, conduct an analysis of data movement, and expose parallel steps. The partition is required to be acyclic, i.e., the inter-part edges between the vertices from different parts should preserve an acyclic dependency structure among the parts. In this...
Graph pattern mining is an important part of the emerging social network science, and the research of the maximum clique problem is one of the most important research branches. In the big data environment, the mass of nodes and complexity of edges in the graph set a higher requirement on the speed and accuracy of the maximum clique (MCP) study. In this paper, we present a parallel graph partitioning...
We present an online algorithm to, given a fixed array A, retrieve its k smallest elements in optimum time for the worst case, that presents fast response in practice. For this, we devise an introspective version of the Incremental Quicksort (IQS) algorithm, which controls the size of the auxiliary stack of the IQS algorithm via an introspective criteria.
Finding critical nodes in a network is a significant task, highly relevant to network vulnerability and security. We consider the node criticality problem as an algebraic connectivity minimization problem where the objective is to choose nodes which minimize the algebraic connectivity of the resulting network. Previous suboptimal solutions of the problem suffer from the computational complexity associated...
In this paper we consider dynamic shortest path-planning problems on a graph with a single endpoint pair and with potentially changing edge weights over time. Several incremental algorithms exist in the literature that solve this problem, notably among them the Lifelong Planning A* (LPA*) algorithm. Although, in most cases, the LPA* algorithm requires a relatively small number of updates, in some...
Studies of community structure and evolution in large social networks require a fast and accurate algorithm for community detection. As the size of analyzed communities grows, complexity of the community detection algorithm needs to be kept close to linear. The Label Propagation Algorithm (LPA) has the benefits of nearly-linear running time and easy implementation, thus it forms a good basis for efficient...
Given a set of n points in Rd with nonnegative weights, we consider the weighted rectilinear min-sum facility problem to minimize the sum of weighted rectilinear distance between the given points and a new added point. We present four simple algorithms for the weighted rectilinear min-sum facility location problem. The computational experiments demonstrate that the achieved results are not only of...
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a certain value. We study the complexity of the problem CCSP(Gamma), the constraint satisfaction problem with global cardinality constraints that allows...
The CHSO algorithm is a fast algorithm for computing the contribution of a point to the hypervolume of the whole set directly. In this paper an improved CHSO is described. And it is explained by theory why not only the points in the first nondominated front, but also the points in the second nondominated front which are dominated only by one of points in the first nondominated front are considered...
In this paper, a predictive model for compression of mosaic image with Bayer pattern is proposed. It consists of TFNN neural network predictor and adaptive correction part based on context. As in JPEG-LS, the adaptive part of the predictor is context-based and it is used to ldquocancelrdquo the integer part of the offset due to the TFNN predictor. In the meantime, we propose a context quantization...
We consider a system of parallel queues with the constraint that only one queue can be served at a time. Each queue can be served through a wireless channel with intermittent connectivity. We propose a policy which serves the longest connected queue when the lengths of all connected are below a given threshold, and serves the connected queue that exceeds the threshold and has received the least service...
Fast Fourier Transform (FFT) is the most basic and essential part of Software Defined Radio (SDR). Therefore, designing regular, reconfigurable, modular and low hardware complexity FFT computation block is very important. A single FFT block should be configurable for varying length FFT computation and also for computation of different transforms like DCT, DST etc. In this paper, the authors analyze...
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.