39 search results - page 1 / 8 » Embedded Trees and the Support of the ISE |
IWOCA
2009
Springer
13 years 11 months ago
2009
Springer
Embedded trees are labelled rooted trees, where the root has zero label and where the labels of adjacent vertices differ (at most) by
DATE
2005
IEEE
13 years 10 months ago
2005
IEEE
Customization of processor architectures through Instruction Set Extensions (ISEs) is an effective way to meet the growing performance demands of embedded applications. A high-qua...
COMBINATORICS
1999
13 years 4 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
JSYML
2008
13 years 4 months ago
2008
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
GD
2001
Springer
13 years 9 months ago
2001
Springer
We prove that every tree T = (V, E) on n vertices with edges of unit length can be embedded in the plane with distortion O( √ n); that is, we construct a mapping f: V → R2 suc...