16430 search results - page 89 / 3286 » On Computable Tree Functions |
130
click to vote
TOC
2010
14 years 10 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
122
click to vote
ILP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
100
click to vote
ACL
1992
15 years 4 months ago
1992
It has been hypothesized that Tree Adjoining Grammar (TAG) is particularly well suited for sentence generation. It is unclear, however, how a sentence generation system based on T...
156
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
149
Voted
SEBD
1997
15 years 4 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...