Sciweavers

1302 search results - page 49 / 261
» On the Strong Chromatic Number
Sort
View
RSA
2011
89views more  RSA 2011»
15 years 1 months ago
Excluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
József Balogh, Jane Butterfield
BMCBI
2011
14 years 10 months ago
Inference of Chromosome-Specific Copy Numbers Using Population Haplotypes
Background: Using microarray and sequencing platforms, a large number of copy number variations (CNVs) have been identified in humans. In practice, because our human genome is a d...
Yao-Ting Huang, Min-Han Wu
CHES
1999
Springer
133views Cryptology» more  CHES 1999»
15 years 10 months ago
Random Number Generators Founded on Signal and Information Theory
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
David Paul Maher, Robert J. Rance
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 6 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
BMCBI
2010
115views more  BMCBI 2010»
15 years 6 months ago
CONAN: copy number variation analysis software for genome-wide association studies
Background: Genome-wide association studies (GWAS) based on single nucleotide polymorphisms (SNPs) revolutionized our perception of the genetic regulation of complex traits and di...
Lukas Forer, Sebastian Schönherr, Hansi Wei&s...