Sciweavers

785 search results - page 96 / 157
» Embedding a Forest in a Graph
Sort
View
IJON
2006
103views more  IJON 2006»
15 years 4 months ago
Kernel extrapolation
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 ...
S. V. N. Vishwanathan, Karsten M. Borgwardt, Omri ...
DAM
2002
67views more  DAM 2002»
15 years 4 months ago
Optimal arrangement of data in a tree directory
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...
Malwina J. Luczak, Steven D. Noble
IH
1999
Springer
15 years 8 months ago
Hiding Signatures in Graph Coloring Solutions
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...
Gang Qu, Miodrag Potkonjak
CODES
2005
IEEE
15 years 10 months ago
Shift buffering technique for automatic code synthesis from synchronous dataflow graphs
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...
Hyunok Oh, Nikil D. Dutt, Soonhoi Ha
RTCSA
2007
IEEE
15 years 10 months ago
MB++: An Integrated Architecture for Pervasive Computing and High-Performance Computing
MB++ is a system that caters to the dynamic needs of applications in a distributed, pervasive computing environment that has a wide variety of devices that act as producers and co...
David J. Lillethun, David Hilley, Seth Horrigan, U...