Sciweavers

118 search results - page 19 / 24
» A simple proof of Bazzi's theorem
Sort
View
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
15 years 1 months ago
Deterministic identity testing for multivariate polynomials
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Richard J. Lipton, Nisheeth K. Vishnoi
JMLR
2002
115views more  JMLR 2002»
14 years 12 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
IPPS
1999
IEEE
15 years 4 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
FM
1999
Springer
107views Formal Methods» more  FM 1999»
15 years 4 months ago
A Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
CORR
2012
Springer
212views Education» more  CORR 2012»
13 years 8 months ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...