Sciweavers

166 search results - page 19 / 34
» Contracts Made Manifest
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
Shan Lu, Soyeon Park, Eunsoo Seo, Yuanyuan Zhou
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
FUNGAMES
2010
13 years 8 months ago
ajME: making game engines autonomic
Autonomic Computing is now showing its value as a solution to the increased complexities of maintaining computer systems and has been applied to many different fields. In this pap...
Pedro Martins, Julie A. McCann
BMCBI
2007
130views more  BMCBI 2007»
13 years 7 months ago
Differential analysis for high density tiling microarray data
Background: High density oligonucleotide tiling arrays are an effective and powerful platform for conducting unbiased genome-wide studies. The ab initio probe selection method emp...
Srinka Ghosh, Heather A. Hirsch, Edward A. Sekinge...
BMCBI
2005
98views more  BMCBI 2005»
13 years 7 months ago
The effects of normalization on the correlation structure of microarray data
Background: Stochastic dependence between gene expression levels in microarray data is of critical importance for the methods of statistical inference that resort to pooling test-...
Xing Qiu, Andrew I. Brooks, Lev Klebanov, Andrei Y...