Sciweavers

1192 search results - page 34 / 239
» Computing Weakest Readings
Sort
View
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 3 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson
SP
2008
IEEE
115views Security Privacy» more  SP 2008»
14 years 11 months ago
Compromising Reflections-or-How to Read LCD Monitors around the Corner
We present a novel eavesdropping technique for spying at a distance on data that is displayed on an arbitrary computer screen, including the currently prevalent LCD monitors. Our ...
Michael Backes, Markus Dürmuth, Dominique Unr...
BMCBI
2010
120views more  BMCBI 2010»
14 years 12 months ago
Short clones or long clones? A simulation study on the use of paired reads in metagenomics
Background: Metagenomics is the study of environmental samples using sequencing. Rapid advances in sequencing technology are fueling a vast increase in the number and scope of met...
Suparna Mitra, Max Schubach, Daniel H. Huson
WABI
2009
Springer
132views Bioinformatics» more  WABI 2009»
15 years 6 months ago
mpscan: Fast Localisation of Multiple Reads in Genomes
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
Eric Rivals, Leena Salmela, Petteri Kiiskinen, Pet...
CIKM
2011
Springer
13 years 11 months ago
Personalizing web search results by reading level
Traditionally, search engines have ignored the reading difficulty of documents and the reading proficiency of users in computing a document ranking. This is one reason why Web se...
Kevyn Collins-Thompson, Paul N. Bennett, Ryen W. W...