3690 search results - page 635 / 738 » Computation with classical sequents |
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
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...
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
TSD
2007
Springer
15 years 4 months ago
2007
Springer
Sound ontologies need to incorporate source unidentifiable sounds in an adequate and consistent manner. Computational lexical resources like WordNet have either inserted these des...
IEEEPACT
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper describes a compiler for stream programs that efficiently schedules computational kernels and stream memory operations, and allocates on-chip storage. Our compiler uses...
IJCNN
2006
IEEE
15 years 4 months ago
2006
IEEE
— It is difficult to map many existing learning algorithms onto biological networks because the former require a separate learning network. The computational basis of biological...