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.
In the age of big data, many graph algorithms are now required to operate in external memory and deliver performance that does not significantly degrade with the scale of the problem. One particular area that frequently deals with graphs larger than RAM is triangle listing, where the algorithms must carefully piece together edges from multiple partitions to detect cycles. In recent literature, two...
Latent Dirichlet Allocation (LDA) has been widely used in text mining to discover topics from documents. One major approach to learn LDA is Gibbs sampling. The basic Collapsed Gibbs Sampling (CGS) algorithm requires O(NZ) computations to learn an LDA model with Z topics from a corpus containing N tokens. Existing approaches that improve the complexity of CGS focus on reducing the factor Z. In this...
The practice of using divide and conquer techniques to solve complex, time-consuming problems has been in use for a very long time. Here we evaluate the performance of centroid-based clustering techniques, specifically k-means and its two approximation algorithms, the k-means++ and k-means|| (also known as Scalable k-means++), as divide and conquer paradigms applied for the creation of minimum spanning...
We present a deterministic distributed algorithm that computes a (2δ-1)-edge-coloring, or even list-edge-coloring, in any n-node graph with maximum degree δ, in O(log^8 δ ⋅ log n) rounds. This answers one of the long-standing open questions of distributed graph algorithms} from the late 1980s, which asked for a polylogarithmic-time algorithm. See, e.g.,...
With the recent advances in the field of autonomous driving, large scale deployment of such vehicles on public roads is both foreseeable and intended by many manufacturers. In order to not only maintain safety, but also driving comfort and comprehensibility at all times it is necessary to develop and implement modularized and standardized interfaces for planning and information exchange. In this paper,...
Grouping the vertex of the graph into sets of certain sizes such that minimum number of edges cross between the sets is called graph partitioning. This NP (Non-deterministic Polynomial time)-complete problem has important applications in computing, task scheduling, and parallel processing. We are implementing Kernighan-Lin, a local algorithm on both a Central Processing Unit (CPU) and a Graphics Processing...
We address a combinatorial optimization problem, namely the 1D array partitioning problem (1D-APP), having several real world applications such as scheduling independent tasks in parallel environments under contiguity constraint. We propose an exact binary search algorithm of pseudo-linearithmic complexity since the latter depends on the input data values. Our approach involves two phases. The first...
We address the 1D array partitioning problem (1D- APP), an easy combinatorial optimization problem, for which an exact dynamic programming algorithm (DPA) is known in the literature. The DPA is structured in a perfect three DO-loop nest (3DLN) with affine loop bounds. Due to its cubic complexity which may be too time consuming for large size real world problems, we propose a parallelization approach...
Future 5G network provides network slices for applications of different areas on the same physical network. Low-latency is the most key indicators of demand for the slices. How to establish the low-latency network slices is an essential question. This article proposes a mapping algorithm for low-latency network slices based on linear programming. Firstly, this problem can be defined as a linear programming...
Outlier detection is one of the most widely used technique to identify abnormal behavior in raw data. The sense of abnormal deviation mentioned here accounts not only for human made or system errors that naturally occur as part of the data but also as seldomly occuring events. In this paper, we propose a new algorithm called Grid Based Outlier Detection (GBOD) to find the hidden outliers in large...
The sheer volume and size of histopathological images (e.g., 106 MPixel) underscores the need for faster and more accurate Regions-of-interest (ROI) detection algorithms. In this paper, we propose such an algorithm, which has four main components that help achieve greater accuracy and faster speed: First, while using coarse-to-fine topology preserving segmentation as the baseline, the proposed algorithm...
In general, circuit switching (CS) NoCs suffer from path diversity and resource utilization problem. Combining Time-Division Multiplexing (TDM) and Space-Division-Multiplexing (SDM) CS NoCs can reasonably mitigate this problem by increasing the path diversity and improving sharing of sub-channel among multiple connections. In order to investigate and optimize TDM-SDM partitioning strategy, in this...
Issue of using case-based reasoning concerns size control, which can be occurred after reusing the system to fix new set of problems for the next cycle. Accordingly, the algorithm of addition, deletion, partition, and selection are proposed for this reason. However, the problem-based selection model is proposed and offers two main algorithms, which are classifying and deleting obsolete, complex, and...
In previous work, a fully predictable sub-linear runtime heuristic for the multiplication by a constant based on Radix-2r arithmetic using a fixed radix was developed, called RADIX-2r. In this paper, we introduce a new constant multiplication algorithm based also on Radix-2r arithmetic but considering a variable radix. The new version is named RADIX-2r-VAR. Using a variable radix allows to optimize...
Large-scale graph computation is central to applications ranging from language processing to social networks. However, natural graphs tend to have skewed power-law distributions where a small subset of the vertices have a large number of neighbors. Existing graph-parallel systems suffer from load imbalance, high communication cost, or suboptimal and complex processing. In this paper we present GraphA,...
A critical check in the certificate validation process is to determine whether a certificate has been revoked or not. Revocation of a certificate is the objective of invalidation of a certificate before its operational lifetime, which was set during its creation. Traditional certificate revocation systems include Certificate Revocation List (CRL) which requires all users to download the list of revoked...
A low complexity algorithm is proposed for joint allocation of power profiles at the source and relay nodes and subcarrier mode-selection for a single user relay aided orthogonal frequency division multiplexing (OFDM) cooperative communication system. Two scenarios are addressed in this work, in the first scenario, the relay uses DF cooperative relaying to transmit data on a set of available subcarriers,...
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...
As the successor of H.264, High Efficient Video Coding (HEVC) standard includes various novel techniques, including Coding Tree Unit (CTU) structure and additional angular modes used in intra coding. These new techniques promote the coding efficiency on one hand, while increasing the computational complexity significantly on the other hand. In this paper, we propose a fast intra block partitioning...
Community detection is a substantial technique to find out the relationship between nodes in complex networks. By understanding the behavior of elements in a community, one can predict the overall feature of the large scale social network. Detecting different communities in large scale network is a challenging task due to huge data size associated with such network. The main purpose of this paper...
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.