Sciweavers

382 search results - page 36 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
APLAS
2010
ACM
13 years 6 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
BIOINFORMATICS
2007
195views more  BIOINFORMATICS 2007»
13 years 7 months ago
Context-dependent clustering for dynamic cellular state modeling of microarray gene expression
Motivation: High-throughput expression profiling allows researchers to study gene activities globally. Genes with similar expression profiles are likely to encode proteins that ma...
Shinsheng Yuan, Ker-Chau Li
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 6 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
BMCBI
2010
193views more  BMCBI 2010»
13 years 2 months ago
Mayday - integrative analytics for expression data
Background: DNA Microarrays have become the standard method for large scale analyses of gene expression and epigenomics. The increasing complexity and inherent noisiness of the ge...
Florian Battke, Stephan Symons, Kay Nieselt