1794 search results - page 160 / 359 » Visualizing Memory Graphs |
152
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these g...
165
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
157
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
170
Voted
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
184
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...