559 search results - page 31 / 112 » Augmented Marked Graphs |
NIPS
2008
13 years 10 months ago
2008
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
IH
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper presents an implementation of the novel watermarking method proposed by Venkatesan, Vazirani, and Sinha in their recent paper A Graph Theoretic Approach to Sof...
TPDS
2010
13 years 7 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
ICALP
2000
Springer
14 years 14 days ago
2000
Springer
In this paper, we recall how the syntax of diagrams is captured by the diagram editor generator DIAGEN, and outline a visual, rule-based, and objectoriented programming language b...