Folgen
Dan Gutfreund
Dan Gutfreund
IBM Research
Bestätigte E-Mail-Adresse bei us.ibm.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Moments in time dataset: one million videos for event understanding
M Monfort, A Andonian, B Zhou, K Ramakrishnan, SA Bargal, T Yan, ...
IEEE transactions on pattern analysis and machine intelligence 42 (2), 502-508, 2019
6392019
Objectnet: A large-scale bias-controlled dataset for pushing the limits of object recognition models
A Barbu, D Mayo, J Alverio, W Luo, C Wang, D Gutfreund, J Tenenbaum, ...
Advances in neural information processing systems 32, 2019
5732019
Threedworld: A platform for interactive multi-modal physical simulation
C Gan, J Schwartz, S Alter, D Mrowca, M Schrimpf, J Traer, J De Freitas, ...
arXiv preprint arXiv:2007.04954, 2020
2792020
An autonomous debating system
N Slonim, Y Bilu, C Alzate, R Bar-Haim, B Bogin, F Bonin, L Choshen, ...
Nature 591 (7850), 379-384, 2021
2272021
A benchmark dataset for automatic detection of claims and evidence in the context of controversial topics
E Aharoni, A Polnarov, T Lavee, D Hershcovich, R Levy, R Rinott, ...
Proceedings of the first workshop on argumentation mining, 64-68, 2014
1872014
If NP languages are hard on the worst-case, then it is easy to find their hard instances
D Gutfreund, R Shaltiel, A Ta-Shma
Computational Complexity 16 (4), 412-441, 2007
822007
Multi-moments in time: Learning and interpreting models for multi-action video understanding
M Monfort, B Pan, K Ramakrishnan, A Andonian, BA McNamara, ...
IEEE Transactions on Pattern Analysis and Machine Intelligence 44 (12), 9434 …, 2021
772021
Agent: A benchmark for core psychological reasoning
T Shu, A Bhandwaldar, C Gan, K Smith, S Liu, D Gutfreund, E Spelke, ...
International conference on machine learning, 9614-9625, 2021
752021
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
D Gutfreund, R Shaltiel, A Ta-Shma
computational complexity 12 (3), 85-130, 2003
682003
Verifying and decoding in constant depth
S Goldwasser, D Gutfreund, A Healy, T Kaufman, GN Rothblum
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
642007
A lower bound for testing juntas
H Chockler, D Gutfreund
Information Processing Letters 90 (6), 301-305, 2004
622004
3DP3: 3D scene perception via probabilistic programming
N Gothoskar, M Cusumano-Towner, B Zinberg, M Ghavamizadeh, ...
Advances in Neural Information Processing Systems 34, 9600-9612, 2021
492021
Automatic generation of a speech by processing raw claims to a set of arguments
E Aharoni, I Bhattacharya, Y Bilu, D Gutfreund, D Hershcovich, V Raykar, ...
US Patent 9,753,916, 2017
412017
Fooling parity tests with parity gates
D Gutfreund, E Viola
International Workshop on Randomization and Approximation Techniques in …, 2004
412004
Reasoning about human-object interactions through dual attention networks
T Xiao, Q Fan, D Gutfreund, M Monfort, A Oliva, B Zhou
Proceedings of the IEEE/CVF International Conference on Computer Vision …, 2019
402019
On approximating the entropy of polynomial mappings
Z Dvir, D Gutfreund, GN Rothblum, SP Vadhan
362017
Exploiting label dependencies for improved sample complexity
L Chekina, D Gutfreund, A Kontorovich, L Rokach, B Shapira
Machine learning 91, 1-42, 2013
332013
The threedworld transport challenge: A visually guided task-and-motion planning benchmark for physically realistic embodied ai
C Gan, S Zhou, J Schwartz, S Alter, A Bhandwaldar, D Gutfreund, ...
arXiv preprint arXiv:2103.14025, 2021
312021
The complexity of local list decoding
D Gutfreund, GN Rothblum
International Workshop on Approximation Algorithms for Combinatorial …, 2008
282008
A (de) constructive approach to program checking
S Goldwasser, D Gutfreund, A Healy, T Kaufman, GN Rothblum
Proceedings of the fortieth annual ACM symposium on Theory of computing, 143-152, 2008
282008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20