16430 search results - page 838 / 3286 » On Computable Tree Functions |
204
click to vote
DAGSTUHL
2006
15 years 9 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
153
click to vote
MFCS
2004
Springer
16 years 28 days ago
2004
Springer
Abstract. So far the least growth rate known for a divergent inherent ambiguity function was logarithmic. This paper shows that for each computable divergent total non-decreasing f...
191
click to vote
TSD
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. A formal prosody description framework is introduced together with its relation to language semantics and NLP. The framework incorporates deep prosodic structures based o...
148
click to vote
DATE
2010
IEEE
16 years 20 days ago
2010
IEEE
Abstract—Today we can identify a big gap between requirement specification and the generation of test environments. This article extends the Classification Tree Method for Embe...
181
click to vote
FSS
2008
15 years 7 months ago
2008
In this paper we propose a generic methodology for the automated generation of fuzzy models. The methodology is realized in three stages. Initially, a crisp model is created and i...