Sciweavers

7289 search results - page 69 / 1458
» A Dependent Set Theory
Sort
View
ACM
1995
13 years 11 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 5 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
FOCS
1999
IEEE
14 years 7 days ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
JAIR
2006
89views more  JAIR 2006»
13 years 8 months ago
Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
Philippe Adjiman, Philippe Chatalic, Franço...
CICLING
2010
Springer
13 years 6 months ago
A Syntactic Textual Entailment System Based on Dependency Parser
Abstract. The development of a syntactic textual entailment system that compares the dependency relations in both the text and the hypothesis has been reported. The Stanford Depend...
Partha Pakray, Alexander F. Gelbukh, Sivaji Bandyo...