Sciweavers

628 search results - page 123 / 126
» Magic Counting Methods
Sort
View
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
BMCBI
2010
154views more  BMCBI 2010»
13 years 8 months ago
EnvMine: A text-mining system for the automatic extraction of contextual information
Background: For ecological studies, it is crucial to count on adequate descriptions of the environments and samples being studied. Such a description must be done in terms of thei...
Javier Tamames, Victor de Lorenzo
CN
2008
85views more  CN 2008»
13 years 8 months ago
Pollution attacks and defenses for Internet caching systems
Proxy caching servers are widely deployed in today's Internet. While cooperation among proxy caches can significantly improve a network's resilience to denial-ofservice ...
Leiwen Deng, Yan Gao, Yan Chen, Aleksandar Kuzmano...
BMCBI
2006
131views more  BMCBI 2006»
13 years 8 months ago
The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison
Background: Analysis of DNA microarray data takes as input spot intensity measurements from scanner software and returns differential expression of genes between two conditions, t...
Allan A. Sioson, Shrinivasrao P. Mane, Pinghua Li,...
BMCBI
2007
109views more  BMCBI 2007»
13 years 7 months ago
Discarding duplicate ditags in LongSAGE analysis may introduce significant error
Background: During gene expression analysis by Serial Analysis of Gene Expression (SAGE), duplicate ditags are routinely removed from the data analysis, because they are suspected...
Jeppe Emmersen, Anna M. Heidenblut, Annabeth Laurs...