Sciweavers

450 search results - page 57 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
JMLR
2008
83views more  JMLR 2008»
13 years 8 months ago
Evidence Contrary to the Statistical View of Boosting
The statistical perspective on boosting algorithms focuses on optimization, drawing parallels with maximum likelihood estimation for logistic regression. In this paper we present ...
David Mease, Abraham Wyner
WWW
2009
ACM
14 years 3 months ago
Instance-based probabilistic reasoning in the semantic web
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
Pedro Oliveira, Paulo Gomes
GI
2009
Springer
14 years 1 months ago
Taming Selective Strictness
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
Daniel Seidel, Janis Voigtländer
FOCS
2000
IEEE
14 years 1 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
WSC
2000
13 years 10 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen