Sciweavers

1805 search results - page 105 / 361
» A Theory of Closure Operators
Sort
View
CCA
2009
Springer
15 years 11 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
FOSSACS
2006
Springer
15 years 8 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
ESOP
2008
Springer
15 years 6 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
IJCAI
1989
15 years 5 months ago
On the Semantics of Counterfactuals
It is argued that Ginsberg's Possible Worlds Approach to counterfactual implication suffers from a number of defects which are the result of confusing proof theory and model ...
Peter Jackson
PRIB
2010
Springer
242views Bioinformatics» more  PRIB 2010»
15 years 2 months ago
Consensus of Ambiguity: Theory and Application of Active Learning for Biomedical Image Analysis
Abstract. Supervised classifiers require manually labeled training samples to classify unlabeled objects. Active Learning (AL) can be used to selectively label only “ambiguous...
Scott Doyle, Anant Madabhushi