Sciweavers

2911 search results - page 152 / 583
» A Logic of Graph Constraints
Sort
View
JSYML
2002
170views more  JSYML 2002»
15 years 13 days ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
ISSS
1996
IEEE
114views Hardware» more  ISSS 1996»
15 years 5 months ago
Flow Graph Balancing for Minimizing the Required Memory Bandwidth
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
Sven Wuytack, Francky Catthoor, Gjalt G. de Jong, ...
APVIS
2004
15 years 2 months ago
Skeletal Animation for the Exploration of Graphs
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer ...
Damian Merrick, Tim Dwyer
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 26 days ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win
80
Voted
DAC
2002
ACM
16 years 1 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...