Subspace arrangements, graph rigidity and derandomization through submodular optimization.
Orit E. RazAvi WigdersonPublished in: CoRR (2019)
Keyphrases
- min sum
- global optimization
- greedy algorithm
- optimization algorithm
- graph representation
- optimization problems
- graph structure
- principal component analysis
- random walk
- graph theoretic
- weighted graph
- objective function
- graph model
- feature space
- feature extraction
- connected components
- principal components
- graph matching
- optimization method
- point correspondences
- optimization process
- directed acyclic graph
- high order
- structured data
- shortest path
- subspace learning
- subspace methods
- np hard