13306 search results - page 319 / 2662 » Theoretical Computer Science |
170
click to vote
TLCA
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
174
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
154
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
149
click to vote
DIS
2006
Springer
15 years 10 months ago
2006
Springer
We study the combination of Kalman filter and a recently proposed algorithm for dynamically maintaining a sliding window, for learning from streams of examples. We integrate this i...
164
click to vote
ACMSE
2007
ACM
15 years 10 months ago
2007
ACM
We have been funded by the University of North Carolina Office of the President [1] to establish a consortium to promote high performance computing at comprehensive universities t...