Sciweavers

5608 search results - page 33 / 1122
» On the Theory of Matchgate Computations
Sort
View
CCS
2011
ACM
14 years 1 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
15 years 6 months ago
A computable type theory for control systems
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...
Pieter Collins
JAPLL
2006
79views more  JAPLL 2006»
15 years 1 months ago
Innovations in computational type theory using Nuprl
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
Stuart F. Allen, Mark Bickford, Robert L. Constabl...
COLING
1990
15 years 2 months ago
A Computational Approach to Binding Theory
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
Alessandra Giorgi, Fabio Pianesi, Giorgio Satta
IPPS
2007
IEEE
15 years 7 months ago
Applying IC-Scheduling Theory to Familiar Classes of Computations
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Ros...