16430 search results - page 207 / 3286 » On Computable Tree Functions |
105
click to vote
COLING
2002
15 years 3 months ago
2002
We describe a method for generating sentences from "keywords" or "headwords". This method consists of two main parts, candidate-text construction and evaluatio...
113
click to vote
TRANSCI
2011
14 years 11 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
123
click to vote
ACL
2007
15 years 5 months ago
2007
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
141
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
134
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
We present a simple statistical model of molecular function evolution to predict protein function. The model description encodes general knowledge of how molecular function evolve...