16430 search results - page 135 / 3286 » On Computable Tree Functions |
92
Voted
IWCIA
2004
Springer
15 years 9 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
109
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
200
Voted
EGC
2009
Springer
15 years 1 months ago
2009
Springer
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
148
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
128
Voted
ENTCS
2008
15 years 3 months ago
2008
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...