Sciweavers

525 search results - page 100 / 105
» Using Checkable Types in Automatic Protocol Analysis
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
BMCBI
2005
82views more  BMCBI 2005»
13 years 7 months ago
Quality assessment of microarrays: Visualization of spatial artifacts and quantitation of regional biases
Background: Quality-control is an important issue in the analysis of gene expression microarrays. One type of problem is regional bias, in which one region of a chip shows artifac...
Mark Reimers, John N. Weinstein
CCS
2010
ACM
13 years 4 months ago
Practical leakage-resilient pseudorandom generators
Cryptographic systems and protocols are the core of many Internet security procedures (such as SSL, SSH, IPSEC, DNSSEC, secure mail, etc.). At the heart of all cryptographic funct...
Yu Yu, François-Xavier Standaert, Olivier P...
ESE
2006
100views Database» more  ESE 2006»
13 years 7 months ago
An evaluation of combination strategies for test case selection
This paper presents results from a comparative evaluation of five combination strategies. Combination strategies are test case selection methods that combine "interesting&quo...
Mats Grindal, Birgitta Lindström, Jeff Offutt...
USENIX
1994
13 years 9 months ago
Splicing UNIX into a Genome Mapping Laboratory
The Whitehead Institute/MIT Center for Genome Research is responsible for a number of large genome mapping efforts, the scale of which create problems of data and workflow managem...
Lincoln Stein, Andre Marquis, Robert Dredge, Mary ...