Sciweavers

2270 search results - page 67 / 454
» On the distribution of eigenvalues of graphs
Sort
View
CONCUR
2006
Springer
15 years 10 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
GD
2006
Springer
15 years 9 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
IJICT
2007
143views more  IJICT 2007»
15 years 6 months ago
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar
CORR
2006
Springer
86views Education» more  CORR 2006»
15 years 6 months ago
Maximum Entropy MIMO Wireless Channel Models
In this contribution, models of wireless channels are derived from the maximum entropy principle, for several cases where only limited information about the propagation environmen...
Maxime Guillaud, Mérouane Debbah, Aris L. M...
NIPS
2008
15 years 7 months ago
Bounds on marginal probability distributions
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
Joris M. Mooij, Hilbert J. Kappen