We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

2011-12-07 Assigned to GLOBAL SUPERCOMPUTING CORPORATION reassignment
GLOBAL SUPERCOMPUTING CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST …

K-way hypergraph partitioning has an ever-growing use in parallelization of scientific
computing applications. We claim that hypergraph partitioning with multiple constraints and …

Group decision making through the AHP has received significant attention in contemporary
research, the primary focus of which has been on the issues of consistency and consensus …

Despite the extreme success of spectral graph theory, there are relatively few papers
applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular …

US9495223B2 - Method and system for converting a single-threaded software program into an
application-specific supercomputer - Google Patents US9495223B2 - Method and system for …

This paper deals with model-based supervision of a class of system of systems (SoS). The
SoS is modeled using hypergraphs, where their architectural representation allows the …

We introduce a novel definition of curvature for hypergraphs, a natural generalization of
graphs, by introducing a multi-marginal optimal transport problem for a naturally defined …

This article applies customer management of an enterprise to be the research background.
Spatial data mining method is proposed to solve site selection of the service center. Firstly, a …

Graph partitioning is used to solve the problem of distributing computations to a number of
processors, in order to improve the performance of time consuming applications in parallel …