16430 search results - page 505 / 3286 » On Computable Tree Functions |
162
click to vote
EMMCVPR
1999
Springer
15 years 11 months ago
1999
Springer
Size functions are functions from the real plane to thenatural numbers useful for describing shapes of objects. They allow to translate the problem of comparing shapes to the probl...
100
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract. In this note we report the following computational results on partial spread functions in 8 variables: (i) the numbers of equivalence classes of partial spread functions ...
240
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
189
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
195
click to vote
ICALP
2005
Springer
16 years 16 days ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...