Sciweavers

350 search results - page 3 / 70
» Soft Linear Set Theory
Sort
View
EUROCRYPT
2012
Springer
11 years 8 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...
ARTCOM
2009
IEEE
14 years 17 days ago
Image Segmentation - A Survey of Soft Computing Approaches
—Soft Computing is an emerging field that consists of complementary elements of fuzzy logic, neural computing and evolutionary computation. Soft computing techniques have found w...
N. Senthilkumaran, R. Rajesh
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 9 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
IWANN
2009
Springer
14 years 9 days ago
Fuzzy Logic, Soft Computing, and Applications
We survey on the theoretical and practical developments of the theory of fuzzy logic and soft computing. Specifically, we briefly review the history and main milestones of fuzzy ...
Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Acieg...
RR
2010
Springer
13 years 4 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof