Logo

UMass Theory Seminar (CS 891M) - Shared screen with speaker view
Cameron Musco
23:10
@Rajarshi -- in reality its not clear how to efficiently hash to uniform random positions.But its a good model for what would happen if you use like a cryptographic hash function where the output is pretty 'random' given the input
Rajarshi Bhattacharjee
23:43
makes sense. thanks
Cameron Musco
55:34
@raghav I'm not sure they have compared these approaches theoretically. I think it might get a bit complex? You would also imagine even more complex variants. Like sandwiched paritioned filters. But optimizing the parameters there I guess could get really complex.
Raghavendra Addanki
57:05
I see, that suggests that there should be some limitation of repeatedly using bloom filters right?
Cameron Musco
59:43
I think there should be? Although I'm not sure.
Raghavendra Addanki
01:00:16
I see -thanks!
Thomas Buckley
01:04:20
thank you!
Aadam Lokhandwala
01:04:36
Thank you!
Rajarshi Bhattacharjee
01:04:39
thanks!
Chaitanya Thakkar
01:04:40
Thank you and happy holidays everybody!