Sciweavers

187 search results - page 8 / 38
» Generic Graph Algorithms for Sparse Matrix Ordering
Sort
View
PPSC
1997
14 years 10 months ago
Parallel Extensions to the Matrix Template Library
We present the preliminary design for a C++ template library to enable the compositional construction of matrix classes suitable for high performance numerical linear algebra comp...
Andrew Lumsdaine, Brian C. McCandless
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
COMBINATORICS
2000
88views more  COMBINATORICS 2000»
14 years 9 months ago
Note on Sparse Random Graphs and Cover Graphs
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
Tom Bohman, Alan M. Frieze, Miklós Ruszink&...
GBRPR
2009
Springer
15 years 4 months ago
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...
CVPR
2009
IEEE
16 years 4 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...