Sciweavers

265 search results - page 53 / 53
» How to Prove Inductive Theorems
Sort
View
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 4 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
MA
2010
Springer
172views Communications» more  MA 2010»
13 years 3 months ago
On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors
We consider Bayesian analysis of data from multivariate linear regression models whose errors have a distribution that is a scale mixture of normals. Such models are used to analy...
Vivekananda Roy, James P. Hobert
ICTAC
2010
Springer
13 years 2 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
13 years 11 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
LICS
2002
IEEE
13 years 9 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson