Sciweavers

7289 search results - page 71 / 1458
» A Dependent Set Theory
Sort
View
CIE
2005
Springer
14 years 1 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
IWANN
2011
Springer
12 years 10 months ago
A Preliminary Study on the Use of Fuzzy Rough Set Based Feature Selection for Improving Evolutionary Instance Selection Algorith
In recent years, the increasing interest in fuzzy rough set theory has allowed the definition of novel accurate methods for feature selection. Although their stand-alone applicati...
Joaquín Derrac, Chris Cornelis, Salvador Ga...
ENTCS
2006
110views more  ENTCS 2006»
13 years 8 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer
ETS
2002
IEEE
116views Hardware» more  ETS 2002»
13 years 7 months ago
Human Activity Systems: A Theoretical Framework for Designing Learning for Multicultural Settings
In the analysis of any learning environment, whether small or large, one observes within it a "set of human activities related to each other so they can be viewed as a whole&...
Jill Slay
EUROCRYPT
2012
Springer
11 years 10 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...