16430 search results - page 249 / 3286 » On Computable Tree Functions |
137
click to vote
CCCG
2010
15 years 5 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
111
click to vote
DAM
2000
15 years 4 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
142
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, the task of selecting the optimal subset of pronunciation variants from a set of automatically generated candidates is recast as a tree search problem. In this appr...
128
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
126
click to vote
BSL
2008
15 years 4 months ago
2008
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...