Sciweavers

624 search results - page 112 / 125
» The Complexity of Type Analysis of Object Oriented Programs
Sort
View
POS
1998
Springer
14 years 1 months ago
Swizzle Barrier Optimizations for Orthogonal Persistence in Java
Swizzling refers to the translation of object references from an external, persistent format to an internal, transient format used during application execution. Eager swizzling sc...
Kumar Brahnmath, Nathaniel Nystrom, Antony L. Hosk...
BMCBI
2010
109views more  BMCBI 2010»
13 years 9 months ago
ParallABEL: an R library for generalized parallelization of genome-wide association studies
Background: Genome-Wide Association (GWA) analysis is a powerful method for identifying loci associated with complex traits and drug response. Parts of GWA analyses, especially th...
Unitsa Sangket, Surakameth Mahasirimongkol, Wasun ...
POPL
2004
ACM
14 years 9 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
BMCBI
2010
193views more  BMCBI 2010»
13 years 3 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
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 8 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard