16430 search results - page 201 / 3286 » On Computable Tree Functions |
152
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
118
click to vote
UAI
1996
15 years 5 months ago
1996
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architectu...
128
click to vote
FOCM
2006
15 years 4 months ago
2006
We present an approach that allows performing computations related to the Baker-Campbell-Haussdorff (BCH) formula and its generalizations in an arbitrary Hall basis, using labeled...
103
click to vote
ORL
2008
15 years 4 months ago
2008
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also sh...
146
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...