725 search results - page 38 / 145 » Descriptive Set Theory of Families of Small Sets |
158
click to vote
ENTCS
2010
15 years 6 months ago
2010
The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more eleme...
166
click to vote
CDC
2008
IEEE
16 years 20 days ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
136
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
161
click to vote
ITP
2010
15 years 10 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
177
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...