Suivre
Mert Sağlam
Mert Sağlam
KimlikDAO
Adresse e-mail validée de kimlikdao.org - Page d'accueil
Titre
Citée par
Citée par
Année
Tight bounds for Lp samplers, finding duplicates in streams, and related problems
H Jowhari, M Sağlam, G Tardos
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2011
2362011
VoiceFilter-Lite: Streaming targeted voice separation for on-device speech recognition
Q Wang, IL Moreno, M Saglam, K Wilson, A Chiao, R Liu, Y He, W Li, ...
arXiv preprint arXiv:2009.04323, 2020
1032020
Periodicity in streams
F Ergun, H Jowhari, M Sağlam
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010
462010
On the communication complexity of sparse set disjointness and exists-equal problems
M Saglam, G Tardos
arXiv preprint arXiv:1304.1217, 2013
442013
Near log-convexity of measured heat in (discrete) time and consequences
M Sağlam
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
422018
Tight bounds for data stream algorithms and communication problems
M Saglam
Simon Fraser University, 2011
32011
Attentive scoring function for speaker identification
IL Moreno, Q Wang, J Pelecanos, Y Huang, M Saglam
US Patent 11,798,562, 2023
12023
Attentive scoring function for speaker identification
IL Moreno, Q Wang, J Pelecanos, Y Huang, M Saglam
US Patent App. 18/479,615, 2024
2024
Settling the complexity of the k-disjointness and the k-Hamming distance problems
M Saglam
2019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–9