Sciweavers

58 search results - page 11 / 12
» From Implicit via Inductive to Explicit Definitions
Sort
View
EMNLP
2010
13 years 5 months ago
SCFG Decoding Without Binarization
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
Mark Hopkins, Greg Langmead
ESORICS
2008
Springer
13 years 9 months ago
Cryptographic Protocol Explication and End-Point Projection
Abstract. Cryptographic protocols are useful for engineering trust in transactions. There are several languages for describing these protocols, but these tend to capture the commun...
Jay A. McCarthy, Shriram Krishnamurthi
ICAIL
2007
ACM
13 years 11 months ago
The Legal-RDF Ontology. A Generic Model for Legal Documents
Legal-RDF.org1 publishes a practical ontology that models both the layout and content of a document and metadata about the document; these have been built using data models implici...
John McClure
ELPUB
2008
ACM
13 years 9 months ago
The SCOAP3 project: converting the literature of an entire discipline to Open Access
The High-Energy Physics (HEP) community spearheaded Open Access with over half a century of dissemination of pre-prints, culminating in the arXiv system. It is now proposing an Op...
Salvatore Mele
PADL
2012
Springer
12 years 3 months ago
Typing the Numeric Tower
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Fla...