115 search results - page 13 / 23 » Rank 2 Types for Term Graph Rewriting |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
PASTE
2010
ACM
14 years 16 days ago
2010
ACM
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
ISPA
2007
Springer
14 years 1 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
TIP
2008
13 years 7 months ago
2008
We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...