Results 1  10
of
1,371
Computing the shortest path: A* search meets graph theory
, 2005
"... We study the problem of finding a shortest path between two vertices in a directed graph. This is an important problem with many applications, including that of computing driving directions. We allow preprocessing the graph using a linear amount of extra space to store auxiliary information, and usi ..."
Abstract

Cited by 167 (8 self)
 Add to MetaCart
We study the problem of finding a shortest path between two vertices in a directed graph. This is an important problem with many applications, including that of computing driving directions. We allow preprocessing the graph using a linear amount of extra space to store auxiliary information
The University of Florida sparse matrix collection
 NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract

Cited by 536 (17 self)
 Add to MetaCart
and graphs, economic and financial modeling, theoretical and quantum chemistry, chemical process simulation, mathematics and statistics, and power networks). The collection meets a vital need that artificiallygenerated matrices cannot meet, and is widely used by the sparse matrix algorithms community
Motion Graphs
, 2002
"... In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The motion graph consists both of pieces of original motion ..."
Abstract

Cited by 380 (6 self)
 Add to MetaCart
and automatically generated transitions. Motion can be generated simply by building walks on the graph. We present a general framework for extracting particular graph walks that meet a user's specifications. We then show how this framework can be applied to the specific problem of generating different styles
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1388 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Optimal transport meets graph spectra
"... papers [2, 3, 1]. We explain, in the setting of discrete spaces, the definition of optimal transport distance, its dual formula, exact formula for onedimensional measures, its relation to linear programming and various interactions with graph spectra. Remark 1. I will not pursue to give strictly ma ..."
Abstract
 Add to MetaCart
papers [2, 3, 1]. We explain, in the setting of discrete spaces, the definition of optimal transport distance, its dual formula, exact formula for onedimensional measures, its relation to linear programming and various interactions with graph spectra. Remark 1. I will not pursue to give strictly
The Meeting Graph: A New Model for Loop Cyclic Register Allocation
 In Proc. of the Fifth Workshop on Compilers for Parallel Computers (CPC95
, 1995
"... Register allocation is a compiler phase in which the gains can be essential in achieving performance on new architectures exploiting instruction level parallelism. We focus our attention on loops and improve the existing methods by introducing a new kind of graph. We model loop unrolling and registe ..."
Abstract

Cited by 33 (12 self)
 Add to MetaCart
and register allocation together in a common framework, called the meeting graph. We expect our results to significantly improve loop register allocation while keeping the amount of code replication low. As a byproduct, we present an optimal algorithm for allocating loop variables to a rotating register file
The Meeting Graph: A New Framework for Loop Register Allocation
, 1995
"... Register allocation is a compiler phase where the gains can be essential in achieving performance on new architectures exploiting instruction level parallelism. We focus our attention on loops and improve the existing methods by introducing a new kind of graph. We model loop unrolling and register ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
allocation together in a common framework, called the meeting graph. We expect that our results improve significantly loop register allocation while keeping the amount of code replication low. As a byproduct, we present an optimal algorithm for allocating loop variables to a rotating register file, as well
Using The Meeting Graph Framework to Minimise Kernel Loop Unrolling for Scheduled Loops
 in "The 22nd International Workshop on Languages and Compilers for Parallel Computing (LCPC09
"... Abstract. This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular lifetime intervals are known. When loops are software pipelined, the number of values simultaneously alive bec ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
becomes exactly known giving better opportunities for kernel loop unrolling. Furthermore, fixing circular lifetime intervals allows us to reduce the algorithmic complexity of our method compared to [1] by computing a new research space for minimal kernel loop unrolling. The meeting graph (MG) [3] is one
Abstract Computing the Shortest Path: A ∗ Search Meets Graph Theory
"... We propose shortest path algorithms that use A ∗ search in combination with a new graphtheoretic lowerbounding technique based on landmarks and the triangle inequality. Our algorithms compute optimal shortest paths and work on any directed graph. We give experimental results showing that the most ..."
Abstract
 Add to MetaCart
We propose shortest path algorithms that use A ∗ search in combination with a new graphtheoretic lowerbounding technique based on landmarks and the triangle inequality. Our algorithms compute optimal shortest paths and work on any directed graph. We give experimental results showing that the most
Author manuscript, published in "9th Workshop on Optimizations for DSP and Embedded Systems (ODES9) (2011) 8" Decomposing Meeting Graph Circuits to Minimise Kernel Loop Unrolling
"... • the meeting graph framework (6) which is based on mathematical proofs which guarantee that the unroll deinria00637938, ..."
Abstract
 Add to MetaCart
• the meeting graph framework (6) which is based on mathematical proofs which guarantee that the unroll deinria00637938,
Results 1  10
of
1,371