Sciweavers

268 search results - page 23 / 54
» Recursion Theoretic Operators for Function Complexity Classe...
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
55
Voted
BC
2008
72views more  BC 2008»
14 years 9 months ago
Spike-train spectra and network response functions for non-linear integrate-and-fire neurons
Reduced models have long been used as a tool for the analysis of the complex activity taking place in neurons and their coupled networks. Recent advanced in experimental and theore...
Magnus J. E. Richardson
APLAS
2010
ACM
14 years 8 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
FOCS
2007
IEEE
15 years 4 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
101
Voted
MLDM
2007
Springer
15 years 3 months ago
Ensemble-based Feature Selection Criteria
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
Terry Windeatt, Matthew Prior, Niv Effron, Nathan ...