Sciweavers

1806 search results - page 68 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
16 years 12 days ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
POPL
2008
ACM
16 years 6 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
ICSE
2007
IEEE-ACM
16 years 6 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
ICASSP
2008
IEEE
16 years 8 days ago
Functional semi-automated segmentation of renal DCE-MRI sequences
In dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI), segmentation of internal kidney structures like cortex, medulla and pelvo-caliceal cavities is necessary for fun...
Beatrice Chevaillier, Yannick Ponvianne, Jean-Luc ...
GECCO
2003
Springer
127views Optimization» more  GECCO 2003»
15 years 11 months ago
Complex Function Sets Improve Symbolic Discriminant Analysis of Microarray Data
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
David M. Reif, Bill C. White, Nancy Olsen, Thomas ...