3267 search results - page 346 / 654 » Generalized quasirandom graphs |
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
175
Voted
DM
1998
15 years 6 months ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
155
click to vote
PR
2007
15 years 6 months ago
2007
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
190
Voted
SADM
2011
15 years 1 months ago
2011
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...
176
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...