5451 search results - page 28 / 1091 » On very high degrees |
ISCOPE
1998
Springer
15 years 4 months ago
1998
Springer
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
102
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
SC
2004
ACM
15 years 5 months ago
2004
ACM
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
GC
2010
Springer
14 years 9 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
STOC
2004
ACM
16 years 3 days ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...