2517 search results - page 24 / 504 » Specifying Weak Sets |
ICDM
2003
IEEE
15 years 5 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
116
click to vote
DAGM
2008
Springer
15 years 1 months ago
2008
Springer
This paper demonstrates how a simple, yet effective, set of features enables to integrate ensemble classifiers in optical flow based tracking. In particular, gray value differences...
EACL
2006
ACL Anthology
15 years 1 months ago
2006
ACL Anthology
We present a weakly supervised approach to automatic Ontology Population from text and compare it with other two unsupervised approaches. In our experiments we populate a part of ...
104
click to vote
IACR
2011
13 years 11 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
JSYML
2000
14 years 11 months ago
2000
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarde...