Accelerating CUDA graph algorithms at maximum warp
S Hong, SK Kim, T Oguntebi, K Olukotun - Acm Sigplan Notices, 2011 - dl.acm.org
Graphs are powerful data representations favored in many computational domains. Modern
GPUs have recently shown promising results in accelerating computationally challenging …
GPUs have recently shown promising results in accelerating computationally challenging …
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph
datasets are common in many application domains. To understand the underlying …
datasets are common in many application domains. To understand the underlying …
Approximating betweenness centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex
network analysis. It is computationally-expensive to exactly determine betweenness; …
network analysis. It is computationally-expensive to exactly determine betweenness; …
Distributed louvain algorithm for graph community detection
In most real-world networks, the nodes/vertices tend to be organized into tightly-knit modules
known as communities or clusters, such that nodes within a community are more likely to be" …
known as communities or clusters, such that nodes within a community are more likely to be" …
Data and Structural k-Anonymity in Social Networks
The advent of social network sites in the last years seems to be a trend that will likely
continue. What naive technology users may not realize is that the information they provide …
continue. What naive technology users may not realize is that the information they provide …
Scalable graph exploration on multicore processors
Many important problems in computational sciences, social network analysis, security, and
business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In …
business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In …
Large-scale distributed graph computing systems: An experimental evaluation
With the prevalence of graph data in real-world applications (eg, social networks, mobile
phone networks, web graphs, etc.) and their ever-increasing size, many distributed graph …
phone networks, web graphs, etc.) and their ever-increasing size, many distributed graph …
Topic regression multi-modal latent dirichlet allocation for image annotation
D Putthividhy, HT Attias… - 2010 IEEE Computer …, 2010 - ieeexplore.ieee.org
We present topic-regression multi-modal Latent Dirich-let Allocation (tr-mmLDA), a novel
statistical topic model for the task of image and video annotation. At the heart of our new …
statistical topic model for the task of image and video annotation. At the heart of our new …
C-SAW: A framework for graph sampling and random walk on GPUs
Many applications require to learn, mine, analyze and visualize large-scale graphs. These
graphs are often too large to be addressed efficiently using conventional graph processing …
graphs are often too large to be addressed efficiently using conventional graph processing …
Efficient community search with size constraint
The studies of k-truss based community search demonstrated that it can find high-quality
personalized com-munities with good properties such as high connectivity and bounded …
personalized com-munities with good properties such as high connectivity and bounded …