1161 search results - page 52 / 233 » Kinetic Dependence Graphs |
PLDI
2006
ACM
15 years 6 months ago
2006
ACM
Dependence graphs and memoization can be used to efficiently update the output of a program as the input changes dynamically. Recent work has studied techniques for combining the...
105
click to vote
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
121
click to vote
CATS
2006
15 years 1 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
SIAMDM
2008
15 years 13 days ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
100
Voted
DATE
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract— This paper introduces a transformational design method which can be used to map code written in a high level source language, like C, to a coarse grain reconfigurable ...