Sciweavers

319 search results - page 27 / 64
» Cryptographic Assumptions: A Position Paper
Sort
View
ECML
2003
Springer
15 years 2 months ago
A Two-Level Learning Method for Generalized Multi-instance Problems
In traditional multi-instance (MI) learning, a single positive instance in a bag produces a positive class label. Hence, the learner knows how the bag’s class label depends on th...
Nils Weidmann, Eibe Frank, Bernhard Pfahringer
MCS
2004
Springer
15 years 3 months ago
Classifier Fusion Using Triangular Norms
This paper describes a method for fusing a collection of classifiers where the fusion can compensate for some positive correlation among the classifiers. Specifically, it does not ...
Piero P. Bonissone, Kai Goebel, Weizhong Yan
DAARC
2007
Springer
97views Algorithms» more  DAARC 2007»
15 years 1 months ago
Null Subjects Are Reflexives, Not Pronouns
Abstract. It has been a prevalent assumption in the literature that phonetically null Subjects of finite clauses are pronouns. This paper examines in detail this empirical generali...
António Horta Branco
GI
2010
Springer
14 years 8 months ago
Extended Object and Group Tracking: A Comparison of Random Matrices and Random Hypersurface Models
: Based on previous work of the authors, this paper provides a comparison of two different tracking methodologies for extended objects and group targets, where the true shape of th...
Marcus Baum, Michael Feldmann, Dietrich Fraenken, ...
74
Voted
CCS
2009
ACM
15 years 10 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria