Sciweavers

1640 search results - page 277 / 328
» Conditional Independence Trees
Sort
View
FOCS
2004
IEEE
14 years 12 days ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
CONCUR
2000
Springer
14 years 9 days ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
ESANN
2004
13 years 10 months ago
Forbidden magnification? II
The twin of this paper, "Forbidden Magnification? I." [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann ...
Erzsébet Merényi, Abha Jain
BMCBI
2007
140views more  BMCBI 2007»
13 years 8 months ago
Prediction potential of candidate biomarker sets identified and validated on gene expression data from multiple datasets
Background: Independently derived expression profiles of the same biological condition often have few genes in common. In this study, we created populations of expression profiles...
Michael Gormley, William Dampier, Adam Ertel, Bilg...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin