25 search results - page 5 / 5 » Simple structures axiomatized by almost sure theories |
ICTAC
2010
Springer
13 years 3 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
BMCBI
2006
13 years 5 months ago
2006
Background: Single Nucleotide Polymorphisms (SNPs) are the most common type of polymorphisms found in the human genome. Effective genetic association studies require the identific...
SIAMIS
2011
12 years 8 months ago
2011
We analyze the illumination invariance of the level lines of an image. We show that if the scene surface has Lambertian reflectance and the light is directed, then a necessary and...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...