Sciweavers

59 search results - page 10 / 12
» A Pushing-Pulling Method: New Proofs of Intersection Theorem...
Sort
View
WOSP
2010
ACM
14 years 2 months ago
A general result for deriving product-form solutions in markovian models
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
Andrea Marin, Maria Grazia Vigliotti
JMLR
2002
115views more  JMLR 2002»
13 years 7 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
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
13 years 12 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
13 years 12 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
JACM
2002
163views more  JACM 2002»
13 years 7 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...