Sciweavers

108 search results - page 20 / 22
» Communication Complexity of Key Agreement on Small Ranges
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
BMCBI
2010
108views more  BMCBI 2010»
13 years 7 months ago
Error, reproducibility and sensitivity : a pipeline for data processing of Agilent oligonucleotide expression arrays
Background: Expression microarrays are increasingly used to obtain large scale transcriptomic information on a wide range of biological samples. Nevertheless, there is still much ...
Benjamin Chain, Helen Bowen, John Hammond, Wilfrie...
BMCBI
2008
104views more  BMCBI 2008»
13 years 7 months ago
Comparison of methods for estimating the nucleotide substitution matrix
Background: The nucleotide substitution rate matrix is a key parameter of molecular evolution. Several methods for inferring this parameter have been proposed, with different math...
Maribeth Oscamou, Daniel McDonald, Von Bing Yap, G...
INFOSCALE
2007
ACM
13 years 9 months ago
Scalable problem localization for distributed systems: principles and practices
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
Rui Zhang, Bruno C. d. S. Oliveira, Alan Bivens, S...
INFORMS
1998
142views more  INFORMS 1998»
13 years 7 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol