684 search results - page 78 / 137 » On embedding well-separable graphs |
131
click to vote
MEMBRANE
2004
Springer
15 years 9 months ago
2004
Springer
LMNtal (pronounced “elemental”) is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The ...
132
click to vote
IJON
2006
15 years 4 months ago
2006
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
160
click to vote
DAM
2002
15 years 3 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
131
click to vote
IH
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
133
click to vote
CODES
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...