16430 search results - page 309 / 3286 » On Computable Tree Functions |
130
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
143
click to vote
AINA
2008
IEEE
15 years 6 months ago
2008
IEEE
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
126
click to vote
ECCV
2006
Springer
16 years 6 months ago
2006
Springer
For many medical segmentation tasks, the contrast along most of the boundary of the target object is high, allowing simple thresholding or region growing approaches to provide near...
158
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
147
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...