introduction
play

Introduction The MP Problem Solving a system of m multivariate - PowerPoint PPT Presentation

Mar 29, 2024 •460 likes •790 views

Fast Exhaustive Search for Quadratic Systems in F 2 on FPGAs Charles Bouillaguet, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Bo- Yin Yang August 15, 2013 Introduction The MP Problem Solving a system of m multivariate polynomial equations in

  1. Fast Exhaustive Search for Quadratic Systems in F 2 on FPGAs Charles Bouillaguet, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Bo- Yin Yang August 15, 2013

  2. Introduction The MP Problem Solving a system of m multivariate polynomial equations in n variables over F q is called the MP problem . The MP problem is an NP-hard problem even for multivariate quadratic systems and q ✏ 2. Introduction August 15, 2013 1 / 13

  3. ➓ ➓ ➓ Introduction Multivariate Public-Key Cryptography: e.g. HFE, SFLASH, and QUARTZ Provably-Secure Stream Ciphers: e.g. QUAD Introduction August 15, 2013 2 / 13

  4. Introduction Multivariate Public-Key Cryptography: e.g. HFE, SFLASH, and QUARTZ Provably-Secure Stream Ciphers: e.g. QUAD Algebraic Cryptanalysis: Obtain a system of multivariate polynomial equations with the secret among the variables. ➓ Naturally breaks the above, ➓ does not break AES as first advertised, ➓ but does break, e.g., KeeLoq. Complexity? Introduction August 15, 2013 2 / 13

  5. Introduction Most Efficient Algorithm for F 2 : Brute-force search, testing all 2 n possible inputs. Previous Work: On GPUs we can solve a quadratic system of 48+ equations in 48 variables in 21min . Introduction August 15, 2013 3 / 13

  6. Introduction Most Efficient Algorithm for F 2 : Brute-force search, testing all 2 n possible inputs. Previous Work: On GPUs we can solve a quadratic system of 48+ equations in 48 variables in 21min . Research Question: How would specifically designed hardware perform on this task? We approach the answer by solving multivariate quadratic systems on reconfigurable hardware ( FPGAs ). Introduction August 15, 2013 3 / 13

  7. ➓ ➓ ➓ ♣ q ➓ ♣ q ➓ Gray-Code Approach Full-Evaluation Approach ➓ Evaluate the whole equation for each possible input. ➓ Time Complexity: O ♣ 2 n n 2 q ➓ Memory Complexity: O ♣ n q Exhaustive Search August 15, 2013 4 / 13

  8. Gray-Code Approach Full-Evaluation Approach ➓ Evaluate the whole equation for each possible input. ➓ Time Complexity: O ♣ 2 n n 2 q ➓ Memory Complexity: O ♣ n q Gray-Code Approach ➓ Only re-compute those parts of the equation that have changed. ➓ Enumerate input vector in Gray-code order. ➓ Update solution using the derivatives of the involved variables. ➓ Time Complexity: O ♣ 2 n m q ➓ Memory Complexity: O ♣ n 2 m q Trade computation for memory. Exhaustive Search August 15, 2013 4 / 13

  9. ✏ ✏ ✏ ✏ ✏ ✏ ✏ � � � � � � ✏ ☎ � ☎ � ☎ � � � � Gray-Code Approach k ✏ 01010 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 0 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 0 � 0 ☎ 1 � � � � 1 1 1 0 Exhaustive Search August 15, 2013 5 / 13

  10. Gray-Code Approach k ✏ 01010 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 0 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 0 � 0 ☎ 1 � � � � 1 1 1 0 k ✏ 01011 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 1 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 1 � � � � 1 1 1 1 Exhaustive Search August 15, 2013 5 / 13

  11. Gray-Code Approach k ✏ 01010 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 0 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 0 � 0 ☎ 1 � � � � 1 1 1 0 k ✏ 01011 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 1 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 1 � � � � 1 1 1 1 k ✏ 01100 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 1 , x 1 ✏ 0 , x 0 ✏ 0 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 1 � 1 ☎ 0 � 1 ☎ 0 � � � � 1 1 0 0 Exhaustive Search August 15, 2013 5 / 13

  12. ✏ ♣ q ✁ ☎ ✁ � ☎ � ❇ ✏ ♣ q � ♣ q ❇ Gray-Code Approach k ✏ 01010 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 0 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 0 � 0 ☎ 1 � � � � 1 1 1 0 k ✏ 01011 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 1 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 1 � � � � 1 1 1 1 k ✏ 01001 b in Gray-code order f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � � x 1 � x 0 � 1 x 3 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 0 � � � � 1 1 0 1 Exhaustive Search August 15, 2013 5 / 13

  13. ❇ ✏ ♣ q � ♣ q ❇ Gray-Code Approach k ✏ 01010 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 0 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 0 � 0 ☎ 1 � � � � 1 1 1 0 k ✏ 01011 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 1 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 1 � � � � 1 1 1 1 k ✏ 01001 b in Gray-code order f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � � x 1 � x 0 � 1 x 3 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 0 � � � � 1 1 0 1 f ✏ f ♣ 01011 b q ✁ 0 ☎ 1 ✁ � 0 ☎ 0 � 0 1 Exhaustive Search August 15, 2013 5 / 13

  14. Gray-Code Approach k ✏ 01010 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 0 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 0 � 0 ☎ 1 � � � � 1 1 1 0 k ✏ 01011 b ; x 4 ✏ 0 , x 3 ✏ 1 , x 2 ✏ 0 , x 1 ✏ 1 , x 0 ✏ 1 f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � x 3 � x 1 � x 0 � 1 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 1 � � � � 1 1 1 1 k ✏ 01001 b in Gray-code order f ✏ x 4 x 2 � x 3 x 0 � x 2 x 1 � � x 1 � x 0 � 1 x 3 f ✏ 0 ☎ 0 � 1 ☎ 1 � 0 ☎ 0 � � � � 1 1 0 1 f ✏ f ♣ 01011 b q ✁ 0 ☎ 1 ✁ � 0 ☎ 0 � 0 1 ❇ f f ✏ f ♣ 01011 b q � ❇ x 1 ♣ 01001 b q Exhaustive Search August 15, 2013 5 / 13

  15. Gray-Code Approach Full-Evaluation Approach ➓ Evaluate the whole equation for each possible input. ➓ Time Complexity: O ♣ 2 n n 2 q ➓ Memory Complexity: O ♣ n q Gray-Code Approach ➓ Only re-compute those parts of the equation that have changed. ➓ Enumerate input vector in Gray-code order. ➓ Update solution using the derivatives of the involved variables. ➓ Time Complexity: O ♣ 2 n m q ➓ Memory Complexity: O ♣ n 2 m q Trade computation for memory. Exhaustive Search August 15, 2013 6 / 13

  16. Xilinx Spartan6 FPGA Lookup Table (LUT) – LUT-6 Can be seen as ➓ logic: compute any logical expression in 6 variables, ➓ ROM: store 64bit, addressed by 6 address ports. Can be used as two LUT-5 with identical input wires and independent output wires. Exhaustive Search on FPGAs August 15, 2013 7 / 13

  17. Xilinx Spartan6 FPGA Resources ➓ 50% SLICEX ➓ 4 LUT-6 ➓ 8 Flip-Flops ➓ 25% SLICEL + wide multiplexers + carry logic for large adders ➓ 25% SLICEM + LUT can be used as shift registers + LUT can be used as RAM sharing the same write address ➓ Block RAM, DSPs, IO, ... Exhaustive Search on FPGAs August 15, 2013 7 / 13

  18. Gray-Code Algorithm 24: function EVAL( s ) while s . i ➔ 2 n do 25: s . i Ð s . i � 1 ; 26: k 1 Ð BIT 1 ♣ s . i q ; 27: k 2 Ð BIT 2 ♣ s . i q ; 28: if k 2 valid then 29: s . d ✶ r k 1 s Ð s . d ✶ r k 1 s ❵ s . d ✷ r k 1 , k 2 s ; 30: end if 31: s . y Ð s . y ❵ s . d ✶ r k 1 s ; 32: if s . y ✏ 0 then 33: return shr ♣ s . i , 1 q ❵ s . i ; 34: end if 35: end while 36: 37: end function Exhaustive Search on FPGAs August 15, 2013 8 / 13

  19. Parallelization Fix i Variables for 2 i Parallel Instances: ✏ � � x 2 x 1 � x 3 � x 1 � x 0 � 1 f x 4 x 2 x 3 x 0 e.g. i ✏ 2 : f 00 b ✏ 0 ☎ x 2 � 0 ☎ x 0 � x 2 x 1 � � x 1 � x 0 � 1 0 f 01 b ✏ 0 ☎ x 2 � 1 ☎ x 0 � x 2 x 1 � � x 1 � x 0 � 1 1 f 10 b ✏ 1 ☎ x 2 � 0 ☎ x 0 � x 2 x 1 � 0 � x 1 � x 0 � 1 f 11 b ✏ 1 ☎ x 2 � 1 ☎ x 0 � x 2 x 1 � 1 � x 1 � x 0 � 1 2 i independent equations (systems) Exhaustive Search on FPGAs August 15, 2013 9 / 13

  20. Parallelization Fix i Variables for 2 i Parallel Instances: ✏ � � x 2 x 1 � x 3 � x 1 � x 0 � 1 f x 4 x 2 x 3 x 0 e.g. i ✏ 2 : f 00 b ✏ 0 ☎ x 2 � 0 ☎ x 0 � x 2 x 1 � � x 1 � x 0 � 1 0 f 01 b ✏ 0 ☎ x 2 � 1 ☎ x 0 � x 2 x 1 � � x 1 � x 0 � 1 1 f 10 b ✏ 1 ☎ x 2 � 0 ☎ x 0 � x 2 x 1 � 0 � x 1 � x 0 � 1 f 11 b ✏ 1 ☎ x 2 � 1 ☎ x 0 � x 2 x 1 � 1 � x 1 � x 0 � 1 2 i independent equations (systems) sharing the same quadratic terms! Exhaustive Search on FPGAs August 15, 2013 9 / 13

  21. Instance sol buffer buffer LUT-6 or RAM d' new_y new_d' flip new_d' = d' ⊕ d''; flop new_y = d' ⊕ d'' ⊕ y; y inst j,k inst j,k+1 inst j,k+2 inst j,k+3 inst j,k...k+3 d'' k1 Exhaustive Search on FPGAs August 15, 2013 10 / 13

  22. Instance sol buffer buffer LUT-6 Program a LUT-6 or RAM d' directly new_y as two LUT-5. new_d' flip new_d' = d' ⊕ d''; flop new_y = d' ⊕ d'' ⊕ y; y inst j,k inst j,k+1 inst j,k+2 inst j,k+3 inst j,k...k+3 d'' k1 Exhaustive Search on FPGAs August 15, 2013 10 / 13

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION

TRAINING COURSE ON SOCIAL PROTECTION & FORMALIZATION TRINIDAD AND TOBAGO MARCH 15, 2017 INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION INTRODUCTION Design of the NIS Assistance from the

547 views • 23 slides
INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

INTRODUCTION Introduction 2/42 INTRODUCTION Alternations I am giving bread to the

Patterns of variation in the expression of case and agreement Andrs Brny Leiden University Centre for Linguistics 9 November 2019, BaSIS Workshop a.barany@hum.leidenuniv.nl INTRODUCTION Introduction 2/42 INTRODUCTION

1.37k views • 42 slides
Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures

Introduction Introduction Introduction Introduction Outline Motivation Failures Definition and concepts Process and product properties Principles SE Approaches Motivation Software and the economy The economies of

1.03k views • 49 slides
Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1

Introduction Introduction Introduction Nationwide Cause for Concern 1 https://www.cdc.gov/std/stats17/infographic.htm Introduction Epidemiology in Western Colorado CPHE Surveillance Data Report, May 2018 Chlamydia Epidemiology in Western

977 views • 39 slides
DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every

DAQ introduction Purpose of this talk : (1) Introduction for those who have not been in every meeting (2) Some ideas of diagrams for section 7.1 (Introduction) of TP. Giles Barr 25 Jan 2018, Pembroke College On DUNE, the reality is there is a

474 views • 10 slides
INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT

ADVANCED COMPUTER SECURITY INTRODUCTION cf. Schneider, Chapter 1 INTRODUCTION THEY ARE OUT TO GET YOU INTRODUCTION WHAT IS SECURITY? A systems security policies describe What the system is supposed to do Store and provide access

479 views • 16 slides
Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL

Overview Introduction to SMIL Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout World Wide

387 views • 14 slides
14 Introduction Introduction Bad guys can put malware into Example: hosts

14 Introduction Introduction Bad guys can put malware into Example: hosts

Introduction Introduction source Encapsulation ISO/OSI reference model message M application segment H t H t M transport network datagram H n H n H t M presentation: allow applications to frame link H l H n H t M interpret

583 views • 4 slides
Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL

Previous Lecture Introduction to SMIL 2 Introduction to W3C and XML Introduction to SMIL Writing a SMIL file Adding Media Objects Martin Halvey Clipping media files January 2008 Timing and Synchronising Layout

322 views • 8 slides
Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL

Introduction Zynq Lecture 1 Andreas Habegger Introduction Zynq Introduction Zynq Introduction Zynq PS vs. PL Processing System Processor Peripherals Data Buses AXI Bus Conclusion BTE5380 - Embedded Systems Octobre 2014 Andreas Habegger

1.81k views • 30 slides
2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04

2018.06 01 SMILE5 Introduction S E 5 02 Alpha Cloud M I L 03 Company Introduction 04 Project References S E 5 PART.1 SMILE5 Introduction M I L Introduction STORION-SMILE5 Residential Energy Storage System Inverter 5kW Output Input

1.06k views • 25 slides
Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an

Introduction to CICS Course introduction Course introduction What is CICS? What is an application server? Why use an application server? Course introduction Services provided by CICS How CICS applications are defined Scaling CICS to meet

1.84k views • 146 slides
Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic

Network Visualization Introduction Presented by Shahed Introduction Introduction Basic building blocks Node Links (relationship between nodes) Spatial information Network data

584 views • 9 slides
Introduction Introduction (1) Main argument of the paper: universities are not only

Introduction Introduction (1) Main argument of the paper: universities are not only

Le jugement des pairs comme outil de management des universits Peer-review as a management tool Christine Musselin (CSO, Sciences Po et CNRS) Avril 2013, Lirrsistible ascension du capitalisme acadmique Introduction Introduction (1)

590 views • 28 slides
Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Introduction Introduction to storage and to storage and filesystems filesystems Introduction

Moreno Baricevic Gilberto Daz Axel Kohlmeyer Stefano Cozzini ULA ICTP CNR-IOM DEMOCRITOS Merida, VENEZUELA Trieste, ITALY Trieste, ITALY Introduction Introduction to storage and to storage and filesystems filesystems Introduction

1.19k views • 51 slides
JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of

JABLOTRON JA-100 introduction November 2011 Introduction Todays goals First introduction of the brand new JA-100 alarm system Visions Basic architecture System components Setting Help us with final validations You are the FIRST ones

1.69k views • 111 slides
Algoritmi per la Bioinformatica To abstract from specific computers (processor speed, computer

Algoritmi per la Bioinformatica To abstract from specific computers (processor speed, computer

Computational e ffi ciency of an algorithm is measured in terms of running time and storage space. Algoritmi per la Bioinformatica To abstract from specific computers (processor speed, computer architecture, . . . ) Zsuzsanna Lipt ak

546 views • 6 slides
Objects (XSL-FO ) Asst. Prof. Dr. Kanda Runapongsa (krunapon@kku.ac.th) Dept. of Computer

Objects (XSL-FO ) Asst. Prof. Dr. Kanda Runapongsa (krunapon@kku.ac.th) Dept. of Computer

Extensible Markup Stylesheet Formatting (XSL-FO) 10/20/2006 Extensible Markup Stylesheet Formatting Objects (XSL-FO ) Asst. Prof. Dr. Kanda Runapongsa (krunapon@kku.ac.th) Dept. of Computer Engineering Khon Kaen University 1 Overview

769 views • 37 slides
RevNIC ReverseEngineeringofBinaryDeviceDrivers

RevNIC ReverseEngineeringofBinaryDeviceDrivers

RevNIC ReverseEngineeringofBinaryDeviceDrivers VitalyChipounovandGeorgeCandea SchoolofComputer&Communica3onSciences jeudi, 15 avril 2010 Drivers:HardtoWriteandHardtoPort

1.22k views • 79 slides
CuriousDroid: Automated User Interface Interaction for Android Application Analysis

CuriousDroid: Automated User Interface Interaction for Android Application Analysis

CuriousDroid: Automated User Interface Interaction for Android Application Analysis Sandboxes Patrick Carter, Collin Mulliner, Martina Lindorfer, William Robertson, Engin Kirda 02/23/2016 Android 2015 Q3 Market Share Android iOS

774 views • 26 slides
PROBABILISTIC ANALYSIS OF AN EXHAUSTIVE SEARCH ALGORITHM IN RANDOM GRAPHS Hsien-Kuei Hwang

PROBABILISTIC ANALYSIS OF AN EXHAUSTIVE SEARCH ALGORITHM IN RANDOM GRAPHS Hsien-Kuei Hwang

PROBABILISTIC ANALYSIS OF AN EXHAUSTIVE SEARCH ALGORITHM IN RANDOM GRAPHS Hsien-Kuei Hwang Academia Sinica, Taiwan (joint work with Cyril Banderier, Vlady Ravelomanana, Vytas Zacharovas) AofA 2008, Maresias, Brazil April 14, 2008 Hsien-Kuei

771 views • 59 slides
Parsimony II Search Algorithms Genome 373 Genomic Informatics Elhanan Borenstein A quick

Parsimony II Search Algorithms Genome 373 Genomic Informatics Elhanan Borenstein A quick

Parsimony II Search Algorithms Genome 373 Genomic Informatics Elhanan Borenstein A quick review The parsimony principle: Find the tree that requires the fewest evolutionary changes! A fundamentally different method: Search

590 views • 18 slides
Exhaustive search of optimal formulae for bilinear maps Svyatoslav Covanov Supervisors:

Exhaustive search of optimal formulae for bilinear maps Svyatoslav Covanov Supervisors:

Exhaustive search of optimal formulae for bilinear maps Svyatoslav Covanov Supervisors: Jrmie Detrey and Emmanuel Thom Team CARAMBA January 16, 2017 Optimal formulae 1 Previous work 2 Contribution and experimental results 3

390 views • 22 slides
Neurally-Guided Structure Inference http://ngsi.csail.mit.edu Sidi Lu*, Jiayuan Mao*, Josh

Neurally-Guided Structure Inference http://ngsi.csail.mit.edu Sidi Lu*, Jiayuan Mao*, Josh

Neurally-Guided Structure Inference http://ngsi.csail.mit.edu Sidi Lu*, Jiayuan Mao*, Josh Tenenbaum, and Jiajun Wu (* indicates equal contributions) Structure Inference Structure Inference Data [Kemp et al. 2008] Structure Inference Data

925 views • 38 slides

More recommend