Sciweavers

729 search results - page 140 / 146
» Supporting Use-Case Reviews
Sort
View
TCS
2008
13 years 9 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini
TIFS
2008
129views more  TIFS 2008»
13 years 9 months ago
On Empirical Recognition Capacity of Biometric Systems Under Global PCA and ICA Encoding
Performance of biometric-based recognition systems depends on various factors: database quality, image preprocessing, encoding techniques, etc. Given a biometric database and a se...
Natalia A. Schmid, Francesco Nicolo
BMCBI
2004
174views more  BMCBI 2004»
13 years 9 months ago
Implications for domain fusion protein-protein interactions based on structural information
Background: Several in silico methods exist that were developed to predict protein interactions from the copious amount of genomic and proteomic data. One of these methods is Doma...
Jer-Ming Chia, Prasanna R. Kolatkar
COGSCI
2004
105views more  COGSCI 2004»
13 years 9 months ago
Intention, interpretation and the computational structure of language
I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex repr...
Matthew Stone
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