Sciweavers

326 search results - page 38 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
14 years 3 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
JCO
2010
67views more  JCO 2010»
13 years 8 months ago
Galaxy cutsets in graphs
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
Nicolas Sonnerat, Adrian Vetta
CVPR
2011
IEEE
13 years 6 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
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...
Zhiding Yu, Oscar Au, Ketan Tang
IPPS
2005
IEEE
14 years 3 months ago
Broadcast Trees for Heterogeneous Platforms
In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in...
Olivier Beaumont, Loris Marchal, Yves Robert
LREC
2008
126views Education» more  LREC 2008»
13 years 11 months ago
Tree Distance and Some Other Variants of Evalb
Some alternatives to the standard evalb measures for parser evaluation are considered, principally the use of a tree-distance measure, which assigns a score to a linearity and anc...
Martin Emms