4850 search results - page 212 / 970 » Proof and Computation in Geometry |
159
click to vote
CIE
2005
Springer
16 years 3 days ago
2005
Springer
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
182
click to vote
TLCA
2005
Springer
16 years 1 days ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
157
click to vote
CASSIS
2004
Springer
15 years 12 months ago
2004
Springer
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached...
159
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
157
click to vote
DAGM
2004
Springer
15 years 10 months ago
2004
Springer
The well-known and very simple MinOver algorithm is reformulated for incremental support vector classification with and without kernels. A modified proof for its O(t-1/2 ) converge...