Sciweavers

298 search results - page 4 / 60
» An Analysis of Exponentiation Based on Formal Languages
Sort
View
APL
1993
ACM
13 years 11 months ago
Identification of Parallelism in Neural Networks by Simulation with Language J.
: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is r...
Alexei N. Skurikhin, Alvin J. Surkan
POPL
2012
ACM
12 years 2 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...
COLING
1996
13 years 8 months ago
Top-Down Predictive Linking and Complex-Feature-Based Formalisms
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
James Kilbury
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
13 years 11 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
JCS
2006
118views more  JCS 2006»
13 years 7 months ago
Language based policy analysis in a SPKI Trust Management System
Abstract-- SPKI/SDSI is a standard for issuing authorization and name certificates. SPKI/SDSI can be used to implement a Trust Management System, where the policy for resource acce...
Arun K. Eamani, A. Prasad Sistla