Sciweavers

11862 search results - page 179 / 2373
» Relative information completeness
Sort
View
99
Voted
ISTA
2004
15 years 4 months ago
Object-Relational Mapping Techniques for .NET Framework
: The paper concerns the problem of building an object-relational mapping framework based on the Microsoft .Net platform. The work uses design patterns methodology and proposes to ...
Anatoly E. Doroshenko, Vlad Romanenko
227
Voted
VLDB
2008
ACM
148views Database» more  VLDB 2008»
16 years 2 months ago
Purpose based access control for privacy protection in relational database systems
Abstract In this article, we present a comprehensive approach for privacy preserving access control based on the notion of purpose. In our model, purpose information associated wit...
Ji-Won Byun, Ninghui Li
121
Voted
BMCBI
2010
177views more  BMCBI 2010»
15 years 2 months ago
Clustering of protein families into functional subtypes using Relative Complexity Measure with reduced amino acid alphabets
Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
Aydin Albayrak, Hasan H. Otu, Ugur O. Sezerman
200
Voted
IEICET
2011
14 years 9 months ago
Related-Key Boomerang Attack on Block Cipher SQUARE
Square is 8-round SPN structure block cipher and its round function and key schedule have been slightly modified to design building blocks of Rijndael. Key schedule of Square is s...
Bonwook Koo, Yongjin Yeom, Jung Hwan Song
115
Voted
TARK
2009
Springer
15 years 9 months ago
A logical characterization of iterated admissibility
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
Joseph Y. Halpern, Rafael Pass