198 search results - page 21 / 40 » Weak Probabilistic Anonymity |
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
This paper presents an interdisciplinary investigation of statistical information retrieval (IR) techniques for protein identification from tandem mass spectra, a challenging probl...
ATVA
2006
Springer
14 years 25 days ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
CCS
2006
ACM
14 years 25 days ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...