HPGM: High Performance Graph Mining: Enviaments recents
Ara es mostren els items 1-3 de 3
-
GraSP: distributed streaming graph partitioning
(2015)
Text en actes de congrés
Accés obertThis paper presents a distributed, streaming graph parti- tioner, Graph Streaming Partitioner (GraSP), which makes partition decisions as each vertex is read from memory, sim- ulating an online algorithm that must process ... -
Parallel k nearest neighbor graph construction using tree-based data structures
(2015)
Text en actes de congrés
Accés obertConstruction of a nearest neighbor graph is often a neces- sary step in many machine learning applications. However, constructing such a graph is computationally expensive, es- pecially when the data is high dimensional. ... -
Fast, exact graph diameter computation with vertex programming
(2015)
Text en actes de congrés
Accés obertIn graph theory the diameter is an important topological metric for understanding size and density of a graph. Unfortunately, the graph diameter is computationally di cult to measure for even moderately-sized graphs, ...