Sciweavers

828 search results - page 52 / 166
» Simplicial Powers of Graphs
Sort
View
VLC
2002
99views more  VLC 2002»
13 years 8 months ago
Flexible Graph Layout for the Web
More powerful personal computers and higher network bandwidth has meant that graphics has become increasingly important on the web. Graph-based diagrams are one of the most import...
Trevor Hansen, Kim Marriott, Bernd Meyer, Peter J....
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 10 months ago
Spatiotemporal Annotation Graph (STAG): A Data Model for Composite Digital Objects
In this demonstration, we present a database over complex documents, which, in addition to a structured text content, also has update information, annotations, and embedded object...
Smriti Yamini, Amarnath Gupta
EVOW
2005
Springer
14 years 2 months ago
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
István Juhos, Attila Tóth, Jano I. v...
ACSD
2003
IEEE
91views Hardware» more  ACSD 2003»
14 years 2 months ago
A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...
Javier Esparza
CADE
2001
Springer
14 years 1 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
Aart Middeldorp