Sledovat
Mayank Goswami
Mayank Goswami
Associate Professor, Queens College, City University of New York
E-mailová adresa ověřena na: qc.cuny.edu - Domovská stránka
Název
Citace
Citace
Rok
Learning with feature-dependent label noise: A progressive approach
Y Zhang, S Zheng, P Wu, M Goswami, C Chen
arXiv preprint arXiv:2103.07756, 2021
582021
Error-bounded correction of noisy labels
S Zheng, P Wu, A Goswami, M Goswami, D Metaxas, C Chen
International Conference on Machine Learning, 11447-11457, 2020
562020
A topological filter for learning with label noise
P Wu, S Zheng, M Goswami, D Metaxas, C Chen
Advances in neural information processing systems 33, 21382-21393, 2020
412020
Bloom filters, adaptivity, and the dictionary problem
MA Bender, M Farach-Colton, M Goswami, R Johnson, S McCauley, ...
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
382018
Pattern-avoiding access in binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 410-423, 2015
252015
Multi-resolution sketches and locality sensitive hashing for fast trajectory processing
M Astefanoaei, P Cesaretti, P Katsikouli, M Goswami, R Sarkar
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018
242018
Distance sensitive bloom filters without false negatives
M Goswami, R Pagh, F Silvestri, J Sivertsen
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
222017
Is random walk truly memoryless—Traffic analysis and source location privacy under random walks
R Shi, M Goswami, J Gao, X Gu
2013 Proceedings IEEE INFOCOM, 3021-3029, 2013
212013
Topology dependent space filling curves for sensor networks and applications
X Ban, M Goswami, W Zeng, X Gu, J Gao
2013 Proceedings IEEE INFOCOM, 2166-2174, 2013
202013
Approximate range emptiness in constant time and optimal space
M Goswami, A Grønlund, KG Larsen, R Pagh
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
182014
The landscape of bounds for binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1603.04892, 2016
122016
Load balanced short path routing in large-scale wireless networks using area-preserving maps
M Goswami, CC Ni, X Ban, J Gao, XD Gu, V Pingali
Proceedings of the 15th ACM international symposium on Mobile ad hoc …, 2014
122014
Exploration of path space using sensor network geometry
R Jiang, X Ban, M Goswami, W Zeng, J Gao, X Gu
Proceedings of the 10th ACM/IEEE International Conference on Information …, 2011
122011
Self-adjusting binary search trees: What makes them tick?
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
Algorithms-ESA 2015, 300-312, 2015
112015
Topological detection of trojaned neural networks
S Zheng, Y Zhang, H Wagner, M Goswami, C Chen
Advances in Neural Information Processing Systems 34, 17258-17272, 2021
92021
Uniformity of point samples in metric spaces using gap ratio
A Bishnu, S Desai, A Ghosh, M Goswami, S Paul
SIAM Journal on Discrete Mathematics 31 (3), 2138-2171, 2017
92017
The batched predecessor problem in external memory
MA Bender, M Farach-Colton, M Goswami, D Medjedovic, P Montes, ...
European Symposium on Algorithms, 112-124, 2014
82014
Stability of sgd: Tightness analysis and improved bounds
Y Zhang, W Zhang, S Bald, V Pingali, C Chen, M Goswami
Uncertainty in Artificial Intelligence, 2364-2373, 2022
72022
Computing Teichmüller maps between polygons
M Goswami, X Gu, VP Pingali, G Telang
Foundations of Computational Mathematics 17 (2), 497-526, 2017
72017
Multi-finger binary search trees
P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak
arXiv preprint arXiv:1809.01759, 2018
62018
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20