16430 search results - page 71 / 3286 » On Computable Tree Functions |
NIPS
2008
13 years 11 months ago
2008
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
DOCENG
2009
ACM
14 years 4 months ago
2009
ACM
: © Automated Extensible XML Tree Diagrams John Lumley HP Laboratories HPL-2009-137 XSLT, SVG, XML trees, Functional programming XML is a tree-oriented meta-language and visual de...
CEC
2011
IEEE
12 years 10 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
DAC
2002
ACM
14 years 11 months ago
2002
ACM
RTA
2004
Springer
14 years 3 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...