Sciweavers

420 search results - page 41 / 84
» Generating random regular graphs
Sort
View
FPGA
1997
ACM
145views FPGA» more  FPGA 1997»
13 years 12 months ago
Generation of Synthetic Sequential Benchmark Circuits
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 1 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
TOG
2002
133views more  TOG 2002»
13 years 7 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
JGAA
2008
97views more  JGAA 2008»
13 years 7 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
CAE
2007
13 years 10 months ago
Stipple Placement using Distance in a Weighted Graph
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights ...
David Mould