5606 search results - page 425 / 1122 » Randomization Techniques for Graphs. |
182
click to vote
CGF
2010
15 years 6 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
173
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
165
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract— Large graph datasets are ubiquitous in many domains, including social networking and biology. Graph summarization techniques are crucial in such domains as they can ass...
186
click to vote
DAC
1998
ACM
15 years 11 months ago
1998
ACM
This paper considers the rate optimal VLSI design of a recursive data flow graph (DFG). Previous research on rate optimal scheduling is not directly applicable to VLSI design. We ...
151
click to vote
AIPS
2010
15 years 9 months ago
2010
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...