332 search results - page 11 / 67 » Compositions of Graphs Revisited |
175
click to vote
CASC
2011
Springer
14 years 1 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
130
Voted
MODELS
2009
Springer
15 years 8 months ago
2009
Springer
Model-based development of highly complex software systems leads to large models. Storing them in repositories offers the possibility to work with these models in a distributed env...
ENDM
2006
15 years 1 months ago
2006
We characterize the toroidal graphs with no K3,3-subdivisions as canonical compositions in which 2-pole planar networks are substituted for the edges of non-planar cores. This str...
108
click to vote
CHI
2004
ACM
16 years 2 months ago
2004
ACM
We revisit the definition of regressions in eye tracking, having found existing definitions, formulated within a reading paradigm, unsuitable for visual display assessment. The ne...
97
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....