Sciweavers

377 search results - page 57 / 76
» Constrained Codes as Networks of Relations
Sort
View
ESOP
2009
Springer
14 years 2 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
ACMSE
2006
ACM
13 years 11 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
DAGSTUHL
2007
13 years 9 months ago
What is Input/Output Logic? Input/Output Logic, Constraints, Permissions
We explain the raison d’ˆetre and basic ideas of input/output logic, sketching the central elements with pointers to other publications for detailed developments. The motivation...
David Makinson, Leendert W. N. van der Torre
BMCBI
2006
87views more  BMCBI 2006»
13 years 7 months ago
Phylogeny based discovery of regulatory elements
Background: Algorithms that locate evolutionarily conserved sequences have become powerful tools for finding functional DNA elements, including transcription factor binding sites;...
Jason Gertz, Justin C. Fay, Barak A. Cohen
PPOPP
2006
ACM
14 years 1 months ago
Performance characterization of molecular dynamics techniques for biomolecular simulations
Large-scale simulations and computational modeling using molecular dynamics (MD) continues to make significant impacts in the field of biology. It is well known that simulations...
Sadaf R. Alam, Jeffrey S. Vetter, Pratul K. Agarwa...