16430 search results - page 42 / 3286 » On Computable Tree Functions |
FOIKS
2010
Springer
13 years 11 months ago
2010
Springer
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
- We propose a method of enhancing the reusability of the component IPs by separating communication and computation for a system function. In this approach, we assume that the comp...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
CSDA
2007
13 years 7 months ago
2007
The problem of building a regression tree is considered when the response variable is a probability density function. Splitting criteria which are well adapted to measure the diss...