( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings

, , , и (Ред.) том 2764 из Lecture Notes in Computer Science, Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Sanjeev Kumar

Sachin Arora

Sanjeev Sarpal

Deepak Arora

Deepika Arora

 

Другие публикации лиц с тем же именем

An Exponential Learning Rate Schedule for Deep Learning., и . ICLR, OpenReview.net, (2020)Improved Algorithms for Unique Games via Divide and Conquer., , , и . Electron. Colloquium Comput. Complex., (2010)Unlearning via Sparse Representations., , , , , , , и . CoRR, (2023)A randomized online algorithm for bandwidth utilization., и . SODA, стр. 535-539. ACM/SIAM, (2002)Semidefinite Programming and Approximation Algorithms: A Survey.. SWAT, том 6139 из Lecture Notes in Computer Science, стр. 25. Springer, (2010)Towards a Study of Low-Complexity Graphs., , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 119-131. Springer, (2009)A Practical Algorithm for Topic Modeling with Provable Guarantees, , , , , , , и . CoRR, (2012)A Compressed Sensing View of Unsupervised Text Embeddings, Bag-of-n-Grams, and LSTMs., , , и . ICLR (Poster), OpenReview.net, (2018)Exploring complexity through reductions.. Computational Complexity Theory, том 10 из IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)A Convergence Analysis of Gradient Descent for Deep Linear Neural Networks., , , и . ICLR (Poster), OpenReview.net, (2019)