Sciweavers

286 search results - page 2 / 58
» Weak Ordering - A New Definition
Sort
View
ESOP
2009
Springer
13 years 9 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
APAL
2011
13 years 10 days ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
DGO
2003
121views Education» more  DGO 2003»
13 years 6 months ago
Extending Metadata Definitions by Automatically Extracting and Organizing Glossary Definitions
Metadata descriptions of database contents are required to build and use systems that access and deliver data in response to user requests. When numerous heterogeneous databases a...
Eduard H. Hovy, Andrew Philpot, Judith Klavans, Ul...
MOC
2010
13 years 2 days ago
A new elasticity element made for enforcing weak stress symmetry
Abstract. We introduce a new mixed method for linear elasticity. The novelty is a simplicial element for the approximate stress. For every positive integer k, the row-wise divergen...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Johnny...
CCS
2010
ACM
13 years 5 months ago
Accountability: definition and relationship to verifiability
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt