Sciweavers

4126 search results - page 440 / 826
» Relationships with other Formalisms
Sort
View
JSW
2008
101views more  JSW 2008»
15 years 6 months ago
Broadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
Bogdan Groza
JOLLI
2006
101views more  JOLLI 2006»
15 years 6 months ago
A Note on the Expressive Power of Probabilistic Context Free Grammars
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
Gabriel G. Infante López, Maarten de Rijke
FUIN
2007
123views more  FUIN 2007»
15 years 6 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
SIGPLAN
2008
15 years 6 months ago
Verified enforcement of stateful information release policies
Many organizations specify information release policies to describe the terms under which sensitive information may be released to other organizations. This paper presents a new a...
Nikhil Swamy, Michael Hicks
ISCI
2007
96views more  ISCI 2007»
15 years 6 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao