16430 search results - page 161 / 3286 » On Computable Tree Functions |
149
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
106
Voted
AMAST
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
151
Voted
IPCO
2010
15 years 1 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
142
Voted
BIRTHDAY
2008
Springer
15 years 5 months ago
2008
Springer
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
109
Voted
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...