Sciweavers

1241 search results - page 171 / 249
» Path-oriented random testing
Sort
View
IPMI
2003
Springer
15 years 5 months ago
Ideal-Observer Performance under Signal and Background Uncertainty
We use the performance of the Bayesian ideal observer as a figure of merit for hardware optimization because this observer makes optimal use of signal-detection information. Due t...
Subok Park, Matthew A. Kupinski, Eric Clarkson, Ha...
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 4 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
COLT
2008
Springer
15 years 1 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
93
Voted
BMCBI
2007
128views more  BMCBI 2007»
14 years 12 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
CORR
2007
Springer
117views Education» more  CORR 2007»
14 years 12 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