Sciweavers

515 search results - page 10 / 103
» Layouts of Expander Graphs
Sort
View
APVIS
2004
13 years 11 months ago
Skeletal Animation for the Exploration of Graphs
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer ...
Damian Merrick, Tim Dwyer
TCS
2008
13 years 9 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
ECCC
2010
82views more  ECCC 2010»
13 years 9 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
Ran Raz
IPPS
1999
IEEE
14 years 1 months ago
The Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varv...
APVIS
2004
13 years 11 months ago
Inhomogeneous Force-Directed Layout Algorithms in the Visualisation Pipeline: From Layouts to Visualisations
The visualisation pipeline approach is a flexible and extensible technique for generating visualisations. The basic pipeline functions involve the capture and representation of da...
Neville Churcher, Warwick Irwin, Carl Cook