16430 search results - page 19 / 3286 » On Computable Tree Functions |
EWSN
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. In-network data aggregation is widely recognized as an acceptable means to reduce the amount of transmitted data without adversely affecting the quality of the results. T...
NIPS
2003
13 years 9 months ago
2003
We describe a nonparametric Bayesian approach to generalizing from few labeled examples, guided by a larger set of unlabeled objects and the assumption of a latent tree-structure ...
ALP
1992
Springer
13 years 11 months ago
1992
Springer
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
We present a new representation for a genetic algorithm to evolve molecular structures representing possible drugs that bind to a given protein target receptor. Our representation...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...