Dan Gutfreund
Dan Gutfreund
IBM Research
Geverifieerd e-mailadres voor us.ibm.com - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
2612019
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
1342014
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, ...
1142019
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
672007
A lower bound for testing juntas
H Chockler, D Gutfreund
Information Processing Letters 90 (6), 301-305, 2004
522004
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
D Gutfreund, R Shaltiel, A Ta-Shma
computational complexity 12 (3-4), 85-130, 2003
502003
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
452007
Fooling parity tests with parity gates
D Gutfreund, E Viola
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
372004
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
342021
Threedworld: A platform for interactive multi-modal physical simulation
C Gan, J Schwartz, S Alter, M Schrimpf, J Traer, J De Freitas, J Kubilius, ...
arXiv preprint arXiv:2007.04954, 2020
342020
Exploiting label dependencies for improved sample complexity
L Chekina, D Gutfreund, A Kontorovich, L Rokach, B Shapira
Machine learning 91 (1), 1-42, 2013
322013
On approximating the entropy of polynomial mappings
Z Dvir, D Gutfreund, GN Rothblum, SP Vadhan
272017
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
222019
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
222008
The complexity of local list decoding
D Gutfreund, GN Rothblum
Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008
212008
Trading Help for Interaction in Statistical Zero-Knowledge Proofs.
M Ben-Or, D Gutfreund
Journal of Cryptology 16 (2), 2003
202003
Limitations of hardness vs. randomness under uniform reductions
D Gutfreund, S Vadhan
Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008
182008
Worst-case to average-case reductions revisited
D Gutfreund, A Ta-Shma
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007
182007
Multi-moments in time: Learning and interpreting models for multi-action video understanding
M Monfort, B Pan, K Ramakrishnan, A Andonian, BA McNamara, ...
arXiv preprint arXiv:1911.00232, 2019
162019
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds
B Aydınlıog̃lu, D Gutfreund, JM Hitchcock, A Kawachi
computational complexity 20 (2), 329-366, 2011
162011
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20