Sciweavers

2218 search results - page 128 / 444
» Testing Expressibility Is Hard
Sort
View
IJBRA
2007
89views more  IJBRA 2007»
13 years 9 months ago
Conservative adjustment of permutation p-values when the number of permutations is limited
The permutation procedure is widely used to assess the significance level (p-value) of a test statistic. This approach is asymptotically consistent. In genomics and proteomics st...
Yinglei Lai
MMAS
2010
Springer
13 years 4 months ago
Clustering and Classification through Normalizing Flows in Feature Space
A unified variational methodology is developed for classification and clustering problems, and tested in the classification of tumors from gene expression data. It is based on flu...
J. P. Agnelli, M. Cadeiras, E. G. Tabak, C. V. Tur...
IJSEKE
2011
165views more  IJSEKE 2011»
13 years 18 days ago
Model Checking for Verification of Mandatory Access Control Models and Properties
rather wide gap in abstraction between policies and mechanisms. In this paper, we propose a general approach for property verification for MAC models. The approach defines a stan...
Vincent C. Hu, D. Richard Kuhn, Tao Xie, JeeHyun H...
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 3 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
ICASSP
2010
IEEE
13 years 9 months ago
Weakly supervised learning with decision trees applied to fisheries acoustics
This paper addresses the training of classification trees for weakly labelled data. We call ”weakly labelled data”, a training set such as the prior labelling information pro...
Riwal Lefort, Ronan Fablet, Jean-Marc Boucher