partial functional correspondence
play

Partial functional correspondence Michael Bronstein University of - PowerPoint PPT Presentation

Nov 18, 2022 •26 likes •1.1k views

Partial functional correspondence Michael Bronstein University of Lugano Intel Corporation Lyon, 7 July 2016 1/59 Microsoft Kinect 2010 (Acquired by Intel in 2012) 4/59 Different form factor computers featuring Intel RealSense 3D camera

  1. Perturbation analysis: intuition ∆ M φ 1 φ 2 φ 3 M ¯ M ∆ M φ 1 φ 2 φ 3 ¯ ¯ ¯ ∆ ¯ φ 1 φ 2 φ 3 M Ignoring boundary interaction: disjoint parts (block-diagonal matrix) Eigenvectors = Mixture of eigenvectors of the parts Rodol` a, Cosmo, B, Torsello, Cremers 2016 26/59

  2. Perturbation analysis: eigenvalues 8 . 00 · 10 − 2 M 6 . 00 4 . 00 r k N 2 . 00 0 . 00 10 20 30 40 50 eigenvalue number k ≈ |M| Slope r |N | (depends on the area of the cut) Consistent with Weil’s law Rodol` a, Cosmo, B, Torsello, Cremers 2016 27/59

  3. Perturbation analysis: details ∆ M M t E ¯ ∆ M + t D M M t E ⊤ ∆ ¯ M + t D ¯ M ∆ ¯ M Rodol` a, Cosmo, B, Torsello, Cremers 2016 28/59

  4. Perturbation analysis: details ∆ M M t E ¯ ∆ M + t D M M t E ⊤ ∆ ¯ M + t D ¯ M ∆ ¯ M “How would the Laplacian eigenvalues and eigenvectors of the red part change if we attached a blue part to it?” Rodol` a, Cosmo, B, Torsello, Cremers 2016 28/59

  5. Perturbation analysis: details P M P M n × n n × ¯ n D M E ¯ M “How would the Laplacian eigenvalues and eigenvectors of the red part change if we attached a blue part to it?” Rodol` a, Cosmo, B, Torsello, Cremers 2016 28/59

  6. Perturbation analysis: details M = ¯ Φ ¯ Λ ¯ Denote ∆ M + t P M = Φ ( t ) Λ ( t ) Φ ( t ) ⊤ , ∆ ¯ Φ ⊤ , Φ = Φ (0) , and Λ = Λ (0) . Theorem 1 (eigenvalues) The derivative of the non-trivial eigenvalues is given by � 0 � d 0 dtλ i = φ ⊤ i P M φ i P M = 0 D M Rodol` a, Cosmo, B, Torsello, Cremers 2016 29/59

  7. Perturbation analysis: details M = ¯ Φ ¯ Λ ¯ Denote ∆ M + t P M = Φ ( t ) Λ ( t ) Φ ( t ) ⊤ , ∆ ¯ Φ ⊤ , Φ = Φ (0) , and Λ = Λ (0) . Theorem 1 (eigenvalues) The derivative of the non-trivial eigenvalues is given by � 0 � d 0 dtλ i = φ ⊤ i P M φ i P M = 0 D M Theorem 2 (eigenvectors) Assuming λ i � = λ j for i � = j and λ i � = ¯ λ j for all i, j , the derivative of the non-trivial eigenvectors is given by � 0 ¯ i P ¯ n φ ⊤ n φ ⊤ � i P M φ j d φ j � � 0 ¯ dt φ i = φ j + φ j P = λ i − ¯ λ i − λ j E 0 λ j j =1 j =1 j � = i Rodol` a, Cosmo, B, Torsello, Cremers 2016 29/59

  8. Perturbation analysis: boundary interaction strength 20 10 Value of f Eigenvector perturbation depends on length and position of the boundary Perturbation strength � d dt Φ � F ≤ c � ∂ M f ( m ) dm , where n � φ i ( m ) φ j ( m ) � 2 � f ( m ) = λ i − λ j i,j =1 j � = i Rodol` a, Cosmo, B, Torsello, Cremers 2016 30/59

  9. Laplacian perturbation: typical picture Plate Punctured plate Figure: Filoche, Mayboroda 2009 31/59

  10. Partial functional maps Model shape M T Query shape N Part M ⊆ M ≈ isometric to N M N Data F , G Partial functional map TG ≈ F ( M ) M Rodol` a, Cosmo, B, Torsello, Cremers 2016 32/59

  11. Partial functional maps Model shape M C Query shape N Part M ⊆ M ≈ isometric to N M N Data F , G Partial functional map G ⊤ ΨC ≈ F ( M ) ⊤ Φ M Rodol` a, Cosmo, B, Torsello, Cremers 2016 32/59

  12. Partial functional maps Model shape M C Query shape N Part M ⊆ M ≈ isometric to N v N Data F , G Partial functional map G ⊤ ΨC ≈ F ⊤ diag( v ) Φ v ∈ F ( M ) indicator function of M M Rodol` a, Cosmo, B, Torsello, Cremers 2016 32/59

  13. Partial functional maps Model shape M C Query shape N Part M ⊆ M ≈ isometric to N v N Data F , G Partial functional map G ⊤ ΨC ≈ F ⊤ diag( η ( v )) Φ v ∈ F ( M ) indicator function of M M η ( t ) = 1 2 (tanh(2 t − 1) + 1) Optimization problem w.r.t. correspondence C and part v C , v � G ⊤ ΨC − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ corr ( C ) + ρ part ( v ) min Rodol` a, Cosmo, B, Torsello, Cremers 2016 32/59

  14. Partial functional maps C , v � G ⊤ ΨC − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ corr ( C ) + ρ part ( v ) min Rodol` a, Cosmo, B, Torsello, Cremers 2016 33/59

  15. Partial functional maps C , v � G ⊤ ΨC − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ corr ( C ) + ρ part ( v ) min Part regularization � � 2 � � ρ part ( v ) = µ 1 |N| − η ( v ) dm + µ 2 ξ ( v ) �∇ M v � dm M M � � η ( t ) − 1 where ξ ( t ) ≈ δ 2 Rodol` a, Cosmo, B, Torsello, Cremers 2016; BB 2008 33/59

  16. Partial functional maps C , v � G ⊤ ΨC − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ corr ( C ) + ρ part ( v ) min Part regularization � � 2 � � ρ part ( v ) = µ 1 |N| − η ( v ) dm + µ 2 ξ ( v ) �∇ M v � dm M M � �� � � �� � area preservation Mumford − Shah � � η ( t ) − 1 where ξ ( t ) ≈ δ 2 Rodol` a, Cosmo, B, Torsello, Cremers 2016; BB 2008 33/59

  17. Partial functional maps C , v � G ⊤ ΨC − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ corr ( C ) + ρ part ( v ) min Part regularization � � 2 � � ρ part ( v ) = µ 1 |N| − η ( v ) dm + µ 2 ξ ( v ) �∇ M v � dm M M � �� � � �� � area preservation Mumford − Shah � � η ( t ) − 1 where ξ ( t ) ≈ δ 2 Correspondence regularization � � ρ corr ( C ) = µ 3 � C ◦ W � 2 ( C ⊤ C ) 2 (( C ⊤ C ) ii − d i ) 2 F + µ 4 ij + µ 5 i � = j i Rodol` a, Cosmo, B, Torsello, Cremers 2016; BB 2008 33/59

  18. Partial functional maps C , v � G ⊤ ΨC − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ corr ( C ) + ρ part ( v ) min Part regularization � � 2 � � ρ part ( v ) = µ 1 |N| − η ( v ) dm + µ 2 ξ ( v ) �∇ M v � dm M M � �� � � �� � area preservation Mumford − Shah � � η ( t ) − 1 where ξ ( t ) ≈ δ 2 Correspondence regularization � � ρ corr ( C ) = µ 3 � C ◦ W � 2 ( C ⊤ C ) 2 (( C ⊤ C ) ii − d i ) 2 + µ 4 + µ 5 F ij � �� � i � = j i slant � �� � � �� � rank ≈ r ≈ orthogonality Rodol` a, Cosmo, B, Torsello, Cremers 2016; BB 2008 33/59

  19. Structure of partial functional correspondence 4 2 0 0 20 40 60 80 100 C ⊤ C C W singular values Rodol` a, Cosmo, B, Torsello, Cremers 2016 34/59

  20. Alternating minimization C -step: fix v ∗ , solve for correspondence C C � G ⊤ ΨC − F ⊤ diag( η ( v ∗ )) Φ � 2 , 1 + ρ corr ( C ) min v -step: fix C ∗ , solve for part v v � G ⊤ ΨC ∗ − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ part ( v ) min Rodol` a, Cosmo, B, Torsello, Cremers 2016 35/59

  21. Alternating minimization C -step: fix v ∗ , solve for correspondence C C � G ⊤ ΨC − F ⊤ diag( η ( v ∗ )) Φ � 2 , 1 + ρ corr ( C ) min v -step: fix C ∗ , solve for part v v � G ⊤ ΨC ∗ − F ⊤ diag( η ( v )) Φ � 2 , 1 + ρ part ( v ) min Iteration 1 2 3 4 Rodol` a, Cosmo, B, Torsello, Cremers 2016 35/59

  22. Example of convergence Time (sec.) 0 5 10 15 20 25 10 10 C -step 10 9 v -step 10 8 Energy 10 7 10 6 10 5 10 4 0 20 40 60 80 100 Iteration Rodol` a, Cosmo, B, Torsello, Cremers 2016 36/59

  23. Examples of partial functional maps Rodol` a, Cosmo, B, Torsello, Cremers 2016 37/59

  24. Examples of partial functional maps Rodol` a, Cosmo, B, Torsello, Cremers 2016 37/59

  25. Examples of partial functional maps Rodol` a, Cosmo, B, Torsello, Cremers 2016 37/59

  26. Examples of partial functional maps Rodol` a, Cosmo, B, Torsello, Cremers 2016 37/59

  27. Partial functional maps vs Functional maps 100 150 100 80 50 % Correspondences PFM 60 Func. maps 40 50 100 20 150 0 0 0.05 0.1 0.15 0.2 0.25 Geodesic error Correspondence performance for different rank values k Rodol` a, Cosmo, B, Torsello, Cremers 2016 38/59

  28. Partial correspondence performance Cuts Holes 100 % Correspondences 80 60 40 20 0 0 0.05 0.1 0.15 0.2 0.25 0 0.05 0.1 0.15 0.2 0.25 Geodesic Error Geodesic Error PFM RF IM EN GT SHREC’16 Partial Matching benchmark Rodol` a et al. 2016; Methods: Rodol` a, Cosmo, B, Torsello, Cremers 2016 ( PFM ); Sahillio˘ glu, Yemez 2012 (IM); Rodol` a, Bronstein, Albarelli, Bergamasco, Torsello 2012 (GT); Rodol` a et al. 2013 (EN); Rodol` a et al. 2014 (RF) 39/59

  29. Partial correspondence performance Cuts Holes 1 Mean geodesic error 0 . 8 0 . 6 0 . 4 0 . 2 0 20 40 60 80 20 40 60 80 Partiality (%) Partiality (%) PFM RF IM EN GT SHREC’16 Partial Matching benchmark Rodol` a et al. 2016; Methods: Rodol` a, Cosmo, B, Torsello, Cremers 2016 ( PFM ); Sahillio˘ glu, Yemez 2012 (IM); Rodol` a, Bronstein, Albarelli, Bergamasco, Torsello 2012 (GT); Rodol` a et al. 2013 (EN); Rodol` a et al. 2014 (RF) 40/59

  30. Deep learning + Partial functional maps Correspondence 0 . 1 0 . 0 Correspondence error Boscaini, Masci, Rodol` a, B 2016 41/59

  31. Deep learning + Partial functional maps Correspondence 0 . 1 0 . 0 Correspondence error Boscaini, Masci, Rodol` a, B 2016 42/59

  32. Outline Background: Spectral analysis on manifolds Functional correspondence Partial functional correspondence Non-rigid puzzles 43/59

  33. Litani, BB 2012

  34. Partial correspondence Rodol` a, Cosmo, B, Torsello, Cremers 2016 45/59

  35. Non-rigid puzzle Litani, Rodol` a, BB, Cremers 2016 45/59

  36. Partial Laplacian eigenvectors Functional correspondence matrix C Rodol` a, Cosmo, B, Torsello, Cremers 2016 46/59

  37. Key observation M N N M C N N C M M slant ∝ | N | slant ∝ | M | |N| |M| Litani, Rodol` a, BB, Cremers 2016 47/59

  38. Key observation M N N M C NM = C N N C N M C M M slant ∝ | N | |M| |N| | M | Litani, Rodol` a, BB, Cremers 2016 47/59

  39. Key observation M N N M C NM = C N N C N M C M M slant ∝ | N | |M| | M | = |N| |N| |M| Litani, Rodol` a, BB, Cremers 2016 47/59

  40. Non-rigid puzzles problem formulation Model Parts Input M 1 C 1 Model M N 1 N c Parts N 1 , . . . , N p 2 C 2 M 2 N c 1 N 2 Output N 1 Segmentation M i ⊆ M M 0 Located parts N i ⊆ N i Correspondences C i Clutter N c i M N 2 Missing parts M 0 Litani, Rodol` a, BB, Cremers 2016 48/59

  41. Non-rigid puzzles problem formulation Model Parts Data F i , G i M 1 C 1 Model basis Φ , Φ ( M i ) N 1 N c Part bases Ψ i , Ψ i ( N i ) 2 C 2 M 2 N c 1 N 2 Data term N 1 F ⊤ i Φ ( M i ) ≈ G ⊤ i Ψ i ( N i ) C i M 0 M N 2 Litani, Rodol` a, BB, Cremers 2016 48/59

  42. Non-rigid puzzles problem formulation p � � G ⊤ Ψ i ( N i ) C i − F ⊤ min i Ψ Ψ i Φ Φ Φ( M i ) � 2 , 1 C i i =1 M i ⊆M ,N i ⊆N i p p � � + λ M ρ part ( M i ) + λ N ρ part ( N i ) i =0 i =1 p � + λ corr ρ corr ( C i ) i =1 s.t. M i ∩ M j = ∅ ∀ i � = j M 0 ∪ M 1 ∪ · · · ∪ M p = M | M i | = | N i | ≥ α |N i | , Litani, Rodol` a, BB, Cremers 2016 49/59

  43. Non-rigid puzzles problem formulation p � � G ⊤ Ψ i C i − F ⊤ min i diag( η ( u i ))Ψ Ψ i diag( η ( v i ))Φ Φ Φ � 2 , 1 C i i =1 u i , v i p p � � + λ M ρ part ( η ( v i )) + λ N ρ part ( η ( u i )) i =0 i =1 p � + λ corr ρ corr ( C i ) i =1 p � s.t. η ( u i ) = 1 i =1 a ⊤ M u i = a ⊤ N v i ≥ α a ⊤ N i 1 Litani, Rodol` a, BB, Cremers 2016 49/59

  44. Convergence example Outer iteration 1 Litani, Rodol` a, BB, Cremers 2016 50/59

  45. Convergence example Outer iteration 2 Litani, Rodol` a, BB, Cremers 2016 50/59

  46. Convergence example Outer iteration 3 Litani, Rodol` a, BB, Cremers 2016 50/59

  47. Convergence example Time (sec) 30 32 34 36 38 40 42 44 46 48 80 90 100 110 120 130 140 150 160 Iteration number Litani, Rodol` a, BB, Cremers 2016 51/59

  48. “Perfect puzzle” example Model/Part Synthetic (TOSCA) Transformation Isometric Clutter No Missing part No Data term Dense (SHOT) Litani, Rodol` a, BB, Cremers 2016 52/59

  49. “Perfect puzzle” example Model/Part Synthetic (TOSCA) Transformation Isometric Clutter No Missing part No Data term Dense (SHOT) Segmentation Litani, Rodol` a, BB, Cremers 2016 52/59

  50. “Perfect puzzle” example Model/Part Synthetic (TOSCA) Transformation Isometric Clutter No Missing part No Data term Dense (SHOT) Correspondence Litani, Rodol` a, BB, Cremers 2016 52/59

  51. Overlapping parts example Model/Part Synthetic (FAUST) Transformation Near-isometric Clutter Yes (overlap) Missing part No Data term Dense (SHOT) Segmentation Litani, Rodol` a, BB, Cremers 2016 53/59

  52. Overlapping parts example Model/Part Synthetic (FAUST) Transformation Near-isometric Clutter Yes (overlap) Missing part No Data term Dense (SHOT) Correspondence Litani, Rodol` a, BB, Cremers 2016 53/59

  53. Overlapping parts example Model/Part Synthetic (FAUST) Transformation Near-isometric Clutter Yes (overlap) Missing part No Data term Dense (SHOT) 0.1 0.0 Correspondence error Litani, Rodol` a, BB, Cremers 2016 53/59

  54. Missing parts example Model/Part Synthetic (TOSCA) Transformation Isometric Clutter Yes (extra part) Missing part Yes Data term Dense (SHOT) Litani, Rodol` a, BB, Cremers 2016 54/59

  55. Missing parts example Model/Part Synthetic (TOSCA) Transformation Isometric Clutter Yes (extra part) Missing part Yes Data term Dense (SHOT) Segmentation Litani, Rodol` a, BB, Cremers 2016 54/59

Recommend

Partial Functional Correspondence Emanuele Rodol` a USI Lugano Joint work with A. T orsello

Partial Functional Correspondence Emanuele Rodol` a USI Lugano Joint work with A. T orsello

Partial Functional Correspondence Emanuele Rodol` a USI Lugano Joint work with A. T orsello M.M. Bronstein L. Cosmo D. Cremers SGP, Berlin, 21 June 2016 1/26 Shape correspondence problem Isometric 2/26 Shape correspondence problem

741 views • 51 slides
BRICS NBE 2004 A Functional Correspondence between Normalization Functions and Abstract

BRICS NBE 2004 A Functional Correspondence between Normalization Functions and Abstract

BRICS NBE 2004 A Functional Correspondence between Normalization Functions and Abstract Machines Olivier Danvy (danvy@brics.dk) BRICS, University of Aarhus, Denmark 1 Plan The functional correspondence. The case of the untyped

702 views • 45 slides
The CurryHoward Correspondence between Temporal Logic and Functional Reactive Programming

The CurryHoward Correspondence between Temporal Logic and Functional Reactive Programming

Functional Reactive Programming Correspondence to Temporal Logic Benefitting from the Correspondence The CurryHoward Correspondence between Temporal Logic and Functional Reactive Programming Wolfgang Jeltsch Brandenburgische Technische

451 views • 19 slides
A Functional Correspondence between Evaluators and Abstract Machines Mads Sig Ager, Dariusz

A Functional Correspondence between Evaluators and Abstract Machines Mads Sig Ager, Dariusz

A Functional Correspondence between Evaluators and Abstract Machines Mads Sig Ager, Dariusz Biernacki, Olivier Danvy , and Jan Midtgaard BRICS, University of Aarhus, Denmark BRICS Nottingham, March 28, 2003 1 Our message A correspondence

560 views • 27 slides
Shape Correspondence and Functional Maps SGP 2017 course Maks Ovsjanikov Based on joint work

Shape Correspondence and Functional Maps SGP 2017 course Maks Ovsjanikov Based on joint work

Shape Correspondence and Functional Maps SGP 2017 course Maks Ovsjanikov Based on joint work with: E. Corman, A. Chambolle, M. Ben-Chen, O. Azencot, A. Butscher, R. Rustamov, J. Solomon, F. Chazal, L. Guibas, D. Nogneng, . Laboratoire

1.01k views • 83 slides
Proofs, upside down A functional correspondence between natural deduction and the sequent calculus

Proofs, upside down A functional correspondence between natural deduction and the sequent calculus

Proofs, upside down A functional correspondence between natural deduction and the sequent calculus Matthias Puech APLAS13 Melbourne, December 11, 2013 1 / 19 An intuition Natural deductions are reversed sequent calculus proofs 2 / 19

955 views • 66 slides
Business Correspondence Tone! Dr Bean ( ) at Business Correspondence Tone! Tone

Business Correspondence Tone! Dr Bean ( ) at Business Correspondence Tone! Tone

Tone 2 emails Strategies for improving tone Conditional Homework https://github.com/drbean/curriculum/trunk/correspondence Mon Mar 13 09:36:25 CST 2017 Business Correspondence Tone! Dr Bean ( ) at Business Correspondence

557 views • 19 slides
Types of Correspondence Problems and Data Sets 1 1 Correspondence Registration 2

Types of Correspondence Problems and Data Sets 1 1 Correspondence Registration 2

Types of Correspondence Problems and Data Sets 1 1 Correspondence Registration 2 Correspondence Problem Classification How many meshes? Two: Pairwise registration More than two: multi-view registration Initial registration

565 views • 23 slides
package package ca function function ca mjca (simple) correspondence multiple

package package ca function function ca mjca (simple) correspondence multiple

Assos Venue for CARME in ASSOS View of Aegean Sea and island of Lesbos. Turkey, August 2010. Simple correspondence analysis (CA), Simple correspondence analysis (CA), Multiple correspondence analysis (MCA), Multiple correspondence analysis

866 views • 34 slides
Correspondence across views Correspondence: matching points, patches, edges, or regions across

Correspondence across views Correspondence: matching points, patches, edges, or regions across

Correspondence across views Correspondence: matching points, patches, edges, or regions across images Example: estimating fundamental matrix that corresponds two views Slide from Silvio Savarese Example: structure from motion

1.88k views • 44 slides
Overview Partial Constituent Fronting in German The phenomenon: Partial constituent fronting

Overview Partial Constituent Fronting in German The phenomenon: Partial constituent fronting

Overview Partial Constituent Fronting in German The phenomenon: Partial constituent fronting in German Partial VPs Partial APs Kordula De Kuthy Detmar Meurers Partial NPs Interaction: Partial constituents embedded in VPs

224 views • 7 slides
JUST THE MATHS SLIDES NUMBER 14.1 PARTIAL DIFFERENTIATION 1 (Partial derivatives of the

JUST THE MATHS SLIDES NUMBER 14.1 PARTIAL DIFFERENTIATION 1 (Partial derivatives of the

JUST THE MATHS SLIDES NUMBER 14.1 PARTIAL DIFFERENTIATION 1 (Partial derivatives of the first order) by A.J.Hobson 14.1.1 Functions of several variables 14.1.2 The definition of a partial derivative UNIT 14.1 PARTIAL DIFFERENTIATION

295 views • 8 slides
The correspondence problem Deformation-Drive Shape Correspondence Hao (Richard) Zhang 1 , Alla

The correspondence problem Deformation-Drive Shape Correspondence Hao (Richard) Zhang 1 , Alla

The correspondence problem Deformation-Drive Shape Correspondence Hao (Richard) Zhang 1 , Alla Sheffer 2 , Daniel Cohen-Or 3 , Qingnan Zhou 2 , Oliver van Kaick 1 , and Andrea Tagliasacchi 1 July 3, 2008 1 3 2 2 July 3, 2008, Copenhagen,

343 views • 10 slides
Persistent Data Structures (Version Control) Partial Partial Full Full Confluently

Persistent Data Structures (Version Control) Partial Partial Full Full Confluently

Persistent Data Structures (Version Control) Partial Partial Full Full Confluently Confluently Purely Purely Ephemeral persistence persistence persistence functional version version version v 0 v 0 v 0 v 0 list tree DAG car cdr

177 views • 7 slides
D5.1 Post Correspondence Problem (Semi-)Decidability Undecidable Halting Problem Problems

D5.1 Post Correspondence Problem (Semi-)Decidability Undecidable Halting Problem Problems

Theory of Computer Science May 4, 2020 D5. Post Correspondence Problem Theory of Computer Science D5.1 Post Correspondence Problem D5. Post Correspondence Problem Gabriele R oger D5.2 (Un-)Decidability of PCP University of Basel D5.3

548 views • 8 slides
AdS/CFT Correspondence and Differential Geometry Johanna Erdmenger Max PlanckInstitut f ur

AdS/CFT Correspondence and Differential Geometry Johanna Erdmenger Max PlanckInstitut f ur

. . AdS/CFT Correspondence and Differential Geometry Johanna Erdmenger Max PlanckInstitut f ur Physik, M unchen 1 Outline 1. Introduction: The AdS/CFT correspondence 2. Conformal Anomaly 3. AdS/CFT for field theories with N = 1

275 views • 24 slides
Correspondence Management and Workflow Optimisation Workshop Your Facilitator is Nick Sharples

Correspondence Management and Workflow Optimisation Workshop Your Facilitator is Nick Sharples

Welcome to the Correspondence Management and Workflow Optimisation Workshop Your Facilitator is Nick Sharples From DNA Insight Correspondence Management Workflow Optimisation Productive Workflows Correspondence Management Correspondence

1.6k views • 65 slides
AdS/CFT Correspondence and Integrability Kazuhiro Sakai ( Keio University ) Based on

AdS/CFT Correspondence and Integrability Kazuhiro Sakai ( Keio University ) Based on

Nagoya U. 2009-01-15 AdS/CFT Correspondence and Integrability Kazuhiro Sakai ( Keio University ) Based on collaborations with N.Beisert, N.Gromov, V .Kazakov, Y .Satoh, P .Vieira, K.Zarembo 1 0 . Introduction AdS/CFT correspondence --- a

1.06k views • 83 slides
From parametricity to modularity and back in correspondence theory: preliminary considerations

From parametricity to modularity and back in correspondence theory: preliminary considerations

From parametricity to modularity and back in correspondence theory: preliminary considerations Alessandra Palmigiano http://www.appliedlogictudelft.nl SYCO 3 Oxford 27 March 2019 The phenomenon of correspondence F , w p p F

609 views • 31 slides
+ f(x) = Python Functional Programming Python Functional Programming Functional Programming by

+ f(x) = Python Functional Programming Python Functional Programming Functional Programming by

+ f(x) = Python Functional Programming Python Functional Programming Functional Programming by Wikipidia: Functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids

754 views • 27 slides
Investigation of Gauge/Gravity Correspondence Investigation of Gauge/Gravity Correspondence

Investigation of Gauge/Gravity Correspondence Investigation of Gauge/Gravity Correspondence

Investigation of Gauge/Gravity Correspondence Investigation of Gauge/Gravity Correspondence Including Higher Derivative Corrections Including Higher Derivative Corrections Yoshifumi Hyakutake (Osaka Univ. KEK) Based on arXiv:0811.3102 with

462 views • 28 slides
Light glueball spectrum from the Light glueball spectrum from the AdS/CFT correspondence AdS/CFT

Light glueball spectrum from the Light glueball spectrum from the AdS/CFT correspondence AdS/CFT

Light glueball spectrum from the Light glueball spectrum from the AdS/CFT correspondence AdS/CFT correspondence Frederic Jugeau INFN BARI Orsay 14/11/2007 In collaboration with P. Colangelo, F. De Fazio, S. Nicotri Euroflavour 07 AdS/CFT

509 views • 34 slides
Correspondence retrieval Alexandr Andoni Daniel Hsu Kevin Shi Xiaorui Sun

Correspondence retrieval Alexandr Andoni Daniel Hsu Kevin Shi Xiaorui Sun

Correspondence retrieval Alexandr Andoni Daniel Hsu Kevin Shi Xiaorui Sun Columbia University, Simons Institute for the Theory of Computing July 8th, 2017 1 Problem setup Correspondence retrieval The universe has

476 views • 16 slides
The NN-QFT Correspondence Anindita Maiti ( Northeastern University ) Based on: 2008.08601 with J.

The NN-QFT Correspondence Anindita Maiti ( Northeastern University ) Based on: 2008.08601 with J.

The NN-QFT Correspondence Anindita Maiti ( Northeastern University ) Based on: 2008.08601 with J. Halverson and K. Stoner String Phenomenology Seminar Series Neural Network = Euclidean Quantum Field Theory Build up the new correspondence

607 views • 26 slides

More recommend