Sciweavers

8699 search results - page 312 / 1740
» Elements of the Theory of Computation
Sort
View
FOCM
2011
117views more  FOCM 2011»
15 years 1 months ago
Accuracy and Stability of Computing High-order Derivatives of Analytic Functions by Cauchy Integrals
Abstract High-order derivatives of analytic functions are expressible as Cauchy integrals over circular contours, which can very effectively be approximated, e.g., by trapezoidal s...
Folkmar Bornemann
ENTCS
2008
98views more  ENTCS 2008»
15 years 6 months ago
On Finite-time Computability Preserving Conversions
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
Hideki Tsuiki, Shuji Yamada
COGSCI
2004
106views more  COGSCI 2004»
15 years 6 months ago
Can musical transformations be implicitly learned?
The dominant theory of what people can learn implicitly is that they learn chunks of adjacent elements in sequences. A type of musical grammar that goes beyond specifying allowabl...
Zoltan Dienes, H. Christopher Longuet-Higgins
JACIII
2007
79views more  JACIII 2007»
15 years 6 months ago
State-Transition Computation Models and Program Correctness Thereon
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
Kiyoshi Akama, Ekawit Nantajeewarawat
HICSS
2006
IEEE
144views Biometrics» more  HICSS 2006»
16 years 24 days ago
Habermasian Inquiring System: Toward a General Framework for Knowledge Management Research
This study addresses a long-standing and wellrecognized problem in KM research, namely the lack of conceptual integration and a cumulative tradition. Knowledge management needs an...
Zining Guo, James Sheffield