Search

Your search keyword '"Gutfreund, Dan"' showing total 117 results

Search Constraints

Start Over You searched for: Author "Gutfreund, Dan" Remove constraint Author: "Gutfreund, Dan"
117 results on '"Gutfreund, Dan"'

Search Results

1. LInK: Learning Joint Representations of Design and Performance Spaces through Contrastive Learning for Mechanism Synthesis

2. Learning from Invalid Data: On Constraint Satisfaction in Generative Models

3. 3D Neural Embedding Likelihood: Probabilistic Inverse Graphics for Robust 6D Pose Estimation

4. Beyond Statistical Similarity: Rethinking Metrics for Deep Generative Models in Engineering Design

5. LINKS: A dataset of a hundred million planar linkage mechanisms for data-driven kinematic design

6. Solving the Baby Intuitions Benchmark with a Hierarchically Bayesian Theory of Mind

7. Finding Fallen Objects Via Asynchronous Audio-Visual Integration

8. 3DP3: 3D Scene Perception via Probabilistic Programming

9. Incorporating Rich Social Interactions Into MDPs

10. The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark for Physically Realistic Embodied AI

11. AGENT: A Benchmark for Core Psychological Reasoning

12. Template Controllable keywords-to-text Generation

13. Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modeling

14. ThreeDWorld: A Platform for Interactive Multi-Modal Physical Simulation

15. SimVAE: Simulator-Assisted Training forInterpretable Generative Models

16. Multi-Moments in Time: Learning and Interpreting Models for Multi-Action Video Understanding

17. Reasoning About Human-Object Interactions Through Dual Attention Networks

18. An autonomous debating system

20. LINKS: A Dataset of a Hundred Million Planar Linkage Mechanisms for Data-Driven Kinematic Design

21. Finding Fallen Objects Via Asynchronous Audio-Visual Integration

22. AGENT: A Benchmark for Core Psychological Reasoning

24. 3D Neural Embedding Likelihood for Robust Probabilistic Inverse Graphics

26. Succinct Permanent Is NEXP-Hard with Many Hard Instances : (Extended Abstract)

27. The Complexity of Local List Decoding

28. Limitations of Hardness vs. Randomness under Uniform Reductions

29. Worst-Case to Average-Case Reductions Revisited

30. Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy

33. Fooling Parity Tests with Parity Gates

34. Incorporating Rich Social Interactions Into MDPs

35. The ThreeDWorld Transport Challenge: A Visually Guided Task-and-Motion Planning Benchmark Towards Physically Realistic Embodied AI

40. Moments in Time Dataset: One Million Videos for Event Understanding

50. On Approximating the Entropy of Polynomial Mappings

Catalog

Books, media, physical & digital resources