Sciweavers

16430 search results - page 662 / 3286
» On Computable Tree Functions
Sort
View
JUCS
2007
80views more  JUCS 2007»
15 years 7 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
IJON
2002
82views more  IJON 2002»
15 years 7 months ago
Functional imaging and neuronal information processing
Since the functional magnetic resonance imaging (fMRI) signal is likely to re ect a spatial average of the activity of neurons with partly dissimilar response properties, its inte...
Angel Nevado, Malcolm P. Young, Stefano Panzeri
ML
2002
ACM
100views Machine Learning» more  ML 2002»
15 years 6 months ago
Structure in the Space of Value Functions
Solving in an efficient manner many different optimal control tasks within the same underlying environment requires decomposing the environment into its computationally elemental ...
David J. Foster, Peter Dayan
BIBE
2010
IEEE
148views Bioinformatics» more  BIBE 2010»
15 years 2 months ago
Prediction of Gene Ontology Annotations Based on Gene Functional Clustering
We propose an algorithm that predicts potentially missing Gene Ontology annotations, in order to speed up the time-consuming annotation curation process. The proposed method extend...
Marco Tagliasacchi, Roberto Sarati, Marco Masserol...
CIE
2009
Springer
16 years 1 months ago
Dialectica Interpretation with Fine Computational Control
This paper is an attempt to refine Hernest’s [2] extension of Berger’s uniform quantifiers [1] to G¨odel’s functional (Dialectica) interpretation [3]. We consider the poss...
Trifon Trifonov