391 search results - page 14 / 79 » Formal Universes |
130
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
97
Voted
TCC
2005
Springer
15 years 5 months ago
2005
Springer
In this work, relations between the security notions standard simulatability and universal simulatability for cryptographic protocols are investigated. A simulatability-based notio...
100
Voted
CORR
2000
Springer
15 years 6 days ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
89
Voted
SBMF
2009
Springer
15 years 7 months ago
2009
Springer
Types Hongwei Xi Boston University Work partly funded by NSF grants no. CCR-0229480 and no. CCF-0702665 and General Theoretical Account for Abstract Types – p.1/20
ACL
2010
14 years 10 months ago
2010
Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...