Lower bounds for graph embeddings and combinatorial preconditioners.
Gary L. MillerPeter C. RichterPublished in: SPAA (2004)
Keyphrases
- lower bound
- upper bound
- min sum
- random walk
- branch and bound
- objective function
- directed graph
- graph structure
- branch and bound algorithm
- graph representation
- structured data
- lower and upper bounds
- directed acyclic graph
- graph theory
- weighted graph
- vector space
- constant factor
- optimal solution
- graph matching
- sample complexity
- euclidean space
- low dimensional
- iterative methods
- manifold learning
- edge preserving
- semi supervised
- learning algorithm
- linear program
- structure from motion
- image restoration
- dimensionality reduction