4498 search results - page 580 / 900 » How to Invent Functions |
244
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
In the spirit of Landin, we present a calculus of dependent types to serve as the semantic foundation for a family of languages called data description languages. Such languages, ...
267
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
113
click to vote
RECOMB
2001
Springer
16 years 5 months ago
2001
Springer
We address possible limitations of publicly available data sets of yeast gene expression. We study the predictability of known regulators via time-series analysis, and show that l...
123
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
208
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Large collections of documents are commonly created around a database, where a typical database schema may contain hundreds of tables and thousands of columns. We developed a syst...