148 search results - page 19 / 30 » An Algebraic Theory of Graph Reduction |
158
click to vote
LCTRTS
2009
Springer
16 years 16 days ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
143
click to vote
AMAST
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper shows how systems can be built from their component parts with specified sharing. Its principle contribution is a modular language for configuring systems. A c...
154
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, fo...
225
click to vote
FOSAD
2009
Springer
16 years 9 days ago
2009
Springer
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
152
Voted
FOCS
2009
IEEE
16 years 15 days ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...