Sciweavers

11862 search results - page 23 / 2373
» Relative information completeness
Sort
View
MLQ
2006
93views more  MLQ 2006»
13 years 7 months ago
On the extender algebra being complete
We show that a Woodin cardinal is necessary for the Extender Algebra to be complete. Our proof is relatively simple and does not use fine structure.
Richard Ketchersid, Stuart Zoble
HYBRID
2010
Springer
13 years 5 months ago
Timed I/O automata: a complete specification theory for real-time systems
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
Alexandre David, Kim G. Larsen, Axel Legay, Ulrik ...
BMCBI
2008
193views more  BMCBI 2008»
13 years 7 months ago
Missing value imputation for microarray gene expression data using histone acetylation information
Background: It is an important pre-processing step to accurately estimate missing values in microarray data, because complete datasets are required in numerous expression profile ...
Qian Xiang, Xianhua Dai, Yangyang Deng, Caisheng H...
CI
2004
76views more  CI 2004»
13 years 7 months ago
Negotiating Exchanges of P3p-Labeled Information for Compensation
We consider private information a commodity, of value to both the information holder and the information seeker. Hence, a customer can be enticed to trade his/her private informati...
Scott Buffett, Keping Jia, Sandy Liu, Bruce Spence...
ASIACRYPT
2005
Springer
14 years 1 months ago
Revealing Additional Information in Two-Party Computations
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...
Andreas Jakoby, Maciej Liskiewicz