Sciweavers

1242 search results - page 64 / 249
» The Theory of Grammar Constraints
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Towards a Theory of Anonymous Networking
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
Javad Ghaderi, Rayadurgam Srikant
CPAIOR
2007
Springer
16 years 10 days ago
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
Alessandro Zanarini, Gilles Pesant
BIRTHDAY
2005
Springer
15 years 11 months ago
Graph Transformation with Variables
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
Berthold Hoffmann
TAGT
1998
Springer
162views Graph Theory» more  TAGT 1998»
15 years 10 months ago
Hypergraphs as a Uniform Diagram Representation Model
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
Mark Minas
ENTCS
2006
103views more  ENTCS 2006»
15 years 6 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström