Sciweavers

414 search results - page 15 / 83
» Functional Programming in Sublinear Space
Sort
View
ICALP
2009
Springer
14 years 10 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
NAR
2007
136views more  NAR 2007»
13 years 9 months ago
DBAli tools: mining the protein structure space
The DBAli tools use a comprehensive set of structural alignments in the DBAli database to leverage the structural information deposited in the Protein Data Bank (PDB). These tools...
Marc A. Martí-Renom, Ursula Pieper, Mallur ...
CSL
2004
Springer
14 years 1 months ago
A Functional Scenario for Bytecode Verification of Resource Bounds
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
Roberto M. Amadio, Solange Coupet-Grimal, Silvano ...
ESOP
2009
Springer
14 years 4 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 2 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil