2473 search results - page 189 / 495 » The Logic of Communication Graphs |
159
click to vote
GD
1998
Springer
15 years 8 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
124
Voted
CASCON
1992
15 years 5 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
102
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
112
click to vote
FASE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
127
click to vote
SPIRE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We introduce a new data structure, called MiGaL for “Multiple Graph Layers”, that is composed of various graphs linked together ions of abstraction/refinement. The n...