Sciweavers

3047 search results - page 135 / 610
» Aggregation functions: Means
Sort
View
ICFP
2007
ACM
14 years 9 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
ASIACRYPT
2009
Springer
14 years 3 months ago
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
Abstract. Physical attacks on cryptographic implementations and devices have become crucial. In this context a recent line of research on a new class of side-channel attacks, calle...
Frederik Armknecht, Roel Maes, Ahmad-Reza Sadeghi,...
BMCBI
2008
259views more  BMCBI 2008»
13 years 9 months ago
DISCLOSE : DISsection of CLusters Obtained by SEries of transcriptome data using functional annotations and putative transcripti
Background: A typical step in the analysis of gene expression data is the determination of clusters of genes that exhibit similar expression patterns. Researchers are confronted w...
Evert-Jan Blom, Sacha A. F. T. van Hijum, Klaas J....
JFP
2000
163views more  JFP 2000»
13 years 9 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
STACS
2012
Springer
12 years 4 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...