29 search results - page 4 / 6 » Spanning directed trees with many leaves |
FSTTCS
2005
Springer
13 years 11 months ago
2005
Springer
Monitoring a distributed system to detect a stable property is an important problem with many applications. The problem is especially challenging for a dynamic distributed system b...
APPINF
2003
13 years 7 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...