Sciweavers

1888 search results - page 375 / 378
» Proof theory and computational analysis
Sort
View
CCS
2010
ACM
14 years 12 months ago
On the soundness of authenticate-then-encrypt: formalizing the malleability of symmetric encryption
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
Ueli Maurer, Björn Tackmann
AI
2010
Springer
14 years 11 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
BMCBI
2007
159views more  BMCBI 2007»
14 years 11 months ago
Detecting differential expression in microarray data: comparison of optimal procedures
Background: Many procedures for finding differentially expressed genes in microarray data are based on classical or modified t-statistics. Due to multiple testing considerations, ...
Elena Perelman, Alexander Ploner, Stefano Calza, Y...
BMCBI
2008
100views more  BMCBI 2008»
14 years 11 months ago
PatternLab for proteomics: a tool for differential shotgun proteomics
Background: A goal of proteomics is to distinguish between states of a biological system by identifying protein expression differences. Liu et al. demonstrated a method to perform...
Paulo C. Carvalho, Juliana S. G. Fischer, Emily I....
AI
2006
Springer
14 years 11 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon