Sciweavers

11160 search results - page 389 / 2232
» Incompleteness in a General Setting
Sort
View
ICASSP
2010
IEEE
15 years 7 months ago
Semi-Supervised Fisher Linear Discriminant (SFLD)
Supervised learning uses a training set of labeled examples to compute a classifier which is a mapping from feature vectors to class labels. The success of a learning algorithm i...
Seda Remus, Carlo Tomasi
CIT
2007
Springer
16 years 1 months ago
Performance Assessment of Some Clustering Algorithms Based on a Fuzzy Granulation-Degranulation Criterion
In this paper a fuzzy quantization dequantization criterion is used to propose an evaluation technique to determine the appropriate clustering algorithm suitable for a particular ...
Sriparna Saha, Sanghamitra Bandyopadhyay
CINQ
2004
Springer
131views Database» more  CINQ 2004»
16 years 7 days ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
DIAGRAMS
2000
Springer
15 years 11 months ago
Positive Semantics of Projections in Venn-Euler Diagrams
Venn diagrams and Euler circles have long been used as a means of expressing relationships among sets using visual metaphors such as \disjointness" and \containment" of t...
Joseph Gil, John Howse, Elena Tulchinsky
ASIACRYPT
2004
Springer
16 years 7 days ago
How Far Can We Go Beyond Linear Cryptanalysis?
Abstract. Several generalizations of linear cryptanalysis have been proposed in the past, as well as very similar attacks in a statistical point of view. In this paper, we define ...
Thomas Baignères, Pascal Junod, Serge Vaude...