research
∙
10/19/2021
Boosting Graph Embedding on a Single GPU
Graphs are ubiquitous, and they can model unique characteristics and com...
share
research
∙
06/23/2021
A Bloom Filter Survey: Variants for Different Domain Applications
There is a plethora of data structures, algorithms, and frameworks deali...
research
∙
05/09/2021
Fast and Error-Adaptive Influence Maximization based on Count-Distinct Sketches
Influence maximization (IM) is the problem of finding a seed vertex set ...
research
∙
03/09/2021
Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments
Many well-known, real-world problems involve dynamic data which describe...
research
∙
09/10/2020
Understanding Coarsening for Embedding Large-Scale Graphs
A significant portion of the data today, e.g, social networks, web conne...
research
∙
08/27/2020
GOSH: Embedding Big Graphs on Small Hardware
In graph embedding, the connectivity information of a graph is used to r...
research
∙
08/26/2020
Vertex Ordering Algorithms for Graph Coloring Problem
Graph coloring is a fundamental problem in combinatorics with many appli...
research
∙
08/07/2020
Boosting Parallel Influence-Maximization Kernels for Undirected Networks with Fusing and Vectorization
Influence maximization (IM) is the problem of finding a seed vertex set ...
research
∙
03/02/2019
One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers
Sketches are probabilistic data structures that can provide approximate ...
research
∙
09/05/2015
