5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2010
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition
Lorenzo Orecchia, Nisheeth K. Vishnoi
In this paper, we consider the following graph partitioning problem: The input is an undirected graph a balance parameter and a target conductance value…
cs.DS2010★ 5 cited
Implementing regularization implicitly via approximate eigenvector computation
Michael W. Mahoney, Lorenzo Orecchia
Regularization is a powerful technique for extracting useful information from noisy data. Typically, it is implemented by adding some sort of norm constraint to an objective functi…