Scalable graph processing frameworks: A taxonomy and open challenges
The world is becoming a more conjunct place and the number of data sources such as
social networks, online transactions, web search engines, and mobile devices is increasing …
social networks, online transactions, web search engines, and mobile devices is increasing …
Accelerating CUDA graph algorithms at maximum warp
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 …
Multithreaded asynchronous graph traversal for in-memory and semi-external memory
Processing large graphs is becoming increasingly important for many domains such as
social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do …
social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do …
Scaling techniques for massive scale-free graphs in distributed (external) memory
We present techniques to process large scale-free graphs in distributed memory. Our aim is
to scale to trillions of edges, and our research is targeted at leadership class …
to scale to trillions of edges, and our research is targeted at leadership class …
Hobbes: Composition and virtualization as the foundations of an extreme-scale OS/R
This paper describes our vision for Hobbes, an operating system and runtime (OS/R)
framework for extreme-scale systems. The Hobbes design explicitly supports application …
framework for extreme-scale systems. The Hobbes design explicitly supports application …
The similarity between stochastic kronecker and chung-lu graph models
The analysis of massive graphs is now becoming a very important part of science and
industrial research. This has led to the construction of a large variety of graph models, each …
industrial research. This has led to the construction of a large variety of graph models, each …
Towards a distributed large-scale dynamic graph data store
In many graph applications, the structure of the graph changes dynamically over time and
may require real time analysis. However, constructing a large graph is expensive, and most …
may require real time analysis. However, constructing a large graph is expensive, and most …
Analyzing facial expressions using intensity-variant 3D data for human computer interaction
L Yin, X Wei, P Longo… - … Conference on Pattern …, 2006 - ieeexplore.ieee.org
Research on automatic techniques for analyzing human facial behavior has been
intensified, driven by the emerging research field of affective computing [10, 9] and its …
intensified, driven by the emerging research field of affective computing [10, 9] and its …
Approximate weighted matching on emerging manycore and multithreaded architectures
Graph matching is a prototypical combinatorial problem with many applications in high-
performance scientific computing. Optimal algorithms for computing matchings are …
performance scientific computing. Optimal algorithms for computing matchings are …
[HTML][HTML] Analysis and comparison of high-performance computing solvers for minimisation problems in signal processing
Several physics and engineering applications involve the solution of a minimisation problem
to compute an approximation of the input signal. Modern hardware and software use high …
to compute an approximation of the input signal. Modern hardware and software use high …