Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

This paper presents a novel framework for recognition of facial action unit (AU) combinations
by viewing the classification as a sparse representation problem. Based on this framework …

Large scale graph processing represents an interesting challenge due to the lack of locality.
This paper presents Path Graph for improving iterative graph computation on graphs with …

The performance and energy costs of coordinating and performing data movement have led
to proposals adding compute units and/or specialized access units to the memory hierarchy …

Static mapping is the assignment of parallel processes to the processing elements (PEs) of a
parallel system, where the assignment does not change during the application's lifetime. In …

Graph partitioning is an essential preprocessing step in distributed graph computation and
scientific simulations. Existing well-studied graph partitioners are designed for static graphs …

Query processing for trajectory data is a hot topic in the field of moving objects databases
(MODs). Most of the previous research work focused on the Euclidean space, and the …

Optical circuit switches have recently been proposed as a low-cost, low-power and high-
bandwidth alternative to electronic switches for the design of high-performance compute …

The advent of multi-core architectures provides an opportunity for accelerating parallelism in
mesh-based applications. This multi-core environment, however, imposes challenges not …

This paper addresses two key parallelization challenges the unstructured mesh-based
ocean modeling code, MPAS-Ocean, which uses a mesh based on Voronoi tessellations:(1) …