Dan Gutfreund
Orcid: 0000-0001-5101-4443Affiliations:
- IBM
- Hebrew University of Jerusalem, Israel (former)
According to our database1,
Dan Gutfreund
authored at least 56 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
LInK: Learning Joint Representations of Design and Performance Spaces through Contrastive Learning for Mechanism Synthesis.
CoRR, 2024
Proceedings of the Findings of the Association for Computational Linguistics, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Beyond Statistical Similarity: Rethinking Metrics for Deep Generative Models in Engineering Design.
Comput. Aided Des., December, 2023
CoRR, 2023
CoRR, 2023
How hard are computer vision datasets? Calibrating dataset difficulty to viewing time.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
3D Neural Embedding Likelihood: Probabilistic Inverse Graphics for Robust 6D Pose Estimation.
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023
Zero-Shot Linear Combinations of Grounded Social Interactions with Linear Social MDPs.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
2022
Multi-Moments in Time: Learning and Interpreting Models for Multi-Action Video Understanding.
IEEE Trans. Pattern Anal. Mach. Intell., 2022
LINKS: A dataset of a hundred million planar linkage mechanisms for data-driven kinematic design.
CoRR, 2022
CoRR, 2022
Proceedings of the 2022 International Conference on Robotics and Automation, 2022
The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark Towards Physically Realistic Embodied AI.
Proceedings of the 2022 International Conference on Robotics and Automation, 2022
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022
2021
The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark for Physically Realistic Embodied AI.
CoRR, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
2020
IEEE Trans. Pattern Anal. Mach. Intell., 2020
Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modelling.
CoRR, 2020
2019
ObjectNet: A large-scale bias-controlled dataset for pushing the limits of object recognition models.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, 2019
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2019
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2019
2018
Proceedings of the 2018 IEEE Winter Conference on Applications of Computer Vision, 2018
2017
2016
Proceedings of the 2016 AAAI Fall Symposia, Arlington, Virginia, USA, November 17-19, 2016, 2016
2014
Claims on demand - an initial demonstration of a system for automatic detection and polarity identification of context dependent claims in massive corpora.
Proceedings of the COLING 2014, 2014
A Benchmark Dataset for Automatic Detection of Claims and Evidence in the Context of Controversial Topics.
Proceedings of the First Workshop on Argument Mining, 2014
2013
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
2012
Electron. Colloquium Comput. Complex., 2012
2011
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Comput. Complex., 2011
2010
Electron. Colloquium Comput. Complex., 2010
2009
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.
Electron. Colloquium Comput. Complex., 2009
2008
Electron. Colloquium Comput. Complex., 2008
2007
Electron. Colloquium Comput. Complex., 2007
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.
Comput. Complex., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Proceedings of the Approximation, 2007
2006
New connections between derandomization, worst-case complexity and average-case complexity.
Electron. Colloquium Comput. Complex., 2006
Proceedings of the Approximation, 2006
2005
Derandomization, hard functions, and average-case complexity (דה-רנדומיזציה, פונקציות קשות וסיבוכיות ממוצעת.).
PhD thesis, 2005
2004
2003
Comput. Complex., 2003
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003
2000
Proceedings of the Advances in Cryptology, 2000