Sciweavers

3145 search results - page 40 / 629
» Algebraic Linear Orderings
Sort
View
DAGSTUHL
2006
15 years 5 months ago
The complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
Claude Carlet
ORDER
2008
82views more  ORDER 2008»
15 years 3 months ago
Profinite Heyting Algebras
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
Guram Bezhanishvili, Nick Bezhanishvili
122
Voted
ENTCS
2010
105views more  ENTCS 2010»
15 years 3 months ago
From Focalization of Logic to the Logic of Focalization
Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ...
Michele Basaldella, Alexis Saurin, Kazushige Terui
ICML
2003
IEEE
16 years 4 months ago
Weighted Order Statistic Classifiers with Large Rank-Order Margin
We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifie...
Reid B. Porter, Damian Eads, Don R. Hush, James Th...
120
Voted
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 3 months ago
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
Mikolaj Bojanczyk, Luc Segoufin