1188 search results - page 126 / 238 » Extended Graph Unification |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
ICCAD
2007
IEEE
2007
IEEE
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
15 years 6 months ago
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...