347 search results - page 36 / 70 » Computable Versions of Basic Theorems in Functional Analysis |
227
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
142
click to vote
LICS
2003
IEEE
15 years 9 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
153
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
115
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: Wise et al. introduced a rank-based statistical technique for meta-analysis of genome scans, the Genome Scan Meta-Analysis (GSMA) method. Levinson et al. recently desc...
161
Voted
COLING
2010
14 years 11 months ago
2010
The system presented is a web application designed to aid linguistic research with data collection and online publishing. It is a service mainly for linguists and language experts...