Author:
Neyshabur Behnam,Makarychev Yury,Srebro Nathan
Publisher
Springer International Publishing
Reference18 articles.
1. Alon, N., Naor, A.: Approximating the cut-norm via grothendieck’s inequality. SIAM Journal on Computing 35(4), 787–803 (2006)
2. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459–468 (2006)
3. Arora, S., Berger, E., Hazan, E., Kindler, G., Safra, M.: On non-approximability for quadratic programs. In: FOCS, pp. 206–215 (2005)
4. Banerjee, A., Dhillon, I., Ghosh, J., Merugu, S., Modha, D.S.: A generalized maximum entropy approach to bregman co-clustering and matrix approximation. In: SIGKDD, pp. 509–514 (2004)
5. Buchok, L.V.: Two new approaches to obtaining estimates in the danzer-grunbaum problem. Mathematical Notes 87(4), 489–496 (2010)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献