Sciweavers

30 search results - page 5 / 6
» Private combinatorial group testing
Sort
View
75
Voted
JCO
2008
85views more  JCO 2008»
14 years 10 months ago
Locating and detecting arrays for interaction faults
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
Charles J. Colbourn, Daniel W. McClary
91
Voted
GD
2006
Springer
15 years 2 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
BMCBI
2006
108views more  BMCBI 2006»
14 years 11 months ago
A new pooling strategy for high-throughput screening: the Shifted Transversal Design
Background: In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and ...
Nicolas Thierry-Mieg
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 19 days ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
HICSS
2005
IEEE
116views Biometrics» more  HICSS 2005»
15 years 4 months ago
Why Does State Government Contract Out Their E-Government Services?
Contracting out government services, especially IT services, has accelerated in recent years in the United States. Based on literature in privatization and contracting out, the au...
Anna Ya Ni, Stuart Bretschneider