learning deterministically recognizable tree series
play

Learning Deterministically Recognizable Tree Series Revisited - PowerPoint PPT Presentation

Dec 23, 2023 •288 likes •776 views

Learning Deterministically Recognizable Tree Series Revisited Andreas Maletti , 22 May 2007 00 Motivation Goal Given with

  1. Learning Deterministically Recognizable Tree Series — Revisited Andreas Maletti ✂ ✎✛✛☛✕ ♦ ✗ ✓ ✓✔✑ , 22 May 2007

  2. 00 Motivation Goal ✎ Given ✥ ✿ ❚ ✝ ✦ ❆ with ✭ ❆❀ ✰ ❀ ✁ ❀ ✵ ❀ ✶✮ semifield ✎ Learn finite representation (here: deterministic wta) of ✥ , if possible ✎ Access to ✥ is granted by a certain form of teacher (oracle) TU Dresden, 22 May 2007 Learning deterministic wta slide 2 of 26

  3. 00 Table of Contents Notation Weighted tree automaton Myhill-Nerode congruence Learning algorithm An example TU Dresden, 22 May 2007 Learning deterministic wta slide 3 of 26

  4. 01 Notation Trees ✎ ❚ ✝ : trees over ranked alphabet ✝ ✎ ❈ ✝ : contexts (trees with exactly one occurrence of ✄ ) over ✝ ✎ s✐③❡✭ t ✮ : number of nodes of a tree t Tree series ✎ tree series: mapping of type ❚ ✝ ✦ ❆ ✎ we write ✭ ✥❀ t ✮ for ✥ ✭ t ✮ with ✥ ✿ ❚ ✝ ✦ ❆ ✎ ❆ ❤ ❤ ❚ ✝ ✐ ✐ : set of all mappings of type ❚ ✝ ✦ ❆ TU Dresden, 22 May 2007 Learning deterministic wta slide 4 of 26

  5. 02 Table of Contents Notation Weighted tree automaton Myhill-Nerode congruence Learning algorithm An example TU Dresden, 22 May 2007 Learning deterministic wta slide 5 of 26

  6. 02 Syntax Definition (Borchardt and Vogler ’03) ✭ ◗❀ ✝ ❀ ❆ ❀ ✖❀ ❋ ✮ is a weighted tree automaton (wta) ✎ ◗ is a finite nonempty set (states) ✎ ✝ is a ranked alphabet (of input symbols) ✎ ❆ ❂ ✭ ❆❀ ✰ ❀ ✁ ❀ ✵ ❀ ✶✮ is a semifield (of weights) ✎ ✖ ❂ ✭ ✖ ❦ ✮ ❦ ✕ ✵ with ✖ ❦ ✿ ✝ ✭ ❦ ✮ ✦ ❆ ◗ ❦ ✂ ◗ (called tree representation) ✎ ❋ ✒ ◗ (final states) Definition wta ✭ ◗❀ ✝ ❀ ❆ ❀ ✖❀ ❋ ✮ is deterministic if for every ✛ ✷ ✝ ✭ ❦ ✮ and ✇ ✷ ◗ ❦ there exists at most one q ✷ ◗ such that ✖ ❦ ✭ ✛ ✮ ✇❀q ✻ ❂ ✵ . TU Dresden, 22 May 2007 Learning deterministic wta slide 6 of 26

  7. 02 Example wta ◗ ❂ ❢ S ❀ VP ❀ NP ❀ NN ❀ ADJ ❀ VB ❣ and ❋ ❂ ❢ S ❣ Alice ✵ ✿ ✺ Bob ✵ ✿ ✺ loves ✵ ✿ ✺ hates ✵ ✿ ✺ ✦ NN ✦ NN ✦ VB ✦ VB ugly ✵ ✿ ✷✺ nice ✵ ✿ ✷✺ mean ✵ ✿ ✷✺ tall ✵ ✿ ✷✺ ✦ ADJ ✦ ADJ ✦ ADJ ✦ ADJ ✛ ✛ ✛ ✵ ✿ ✺ ✵ ✿ ✺ ✵ ✿ ✺ ✦ S ✦ S ✦ VP NN VP NP VP VB NN ✛ ✛ ✛ ✵ ✿ ✺ ✵ ✿ ✺ ✵ ✿ ✺ ✦ VP ✦ NP ✦ NP VB NP ADJ NN ADJ NP TU Dresden, 22 May 2007 Learning deterministic wta slide 7 of 26

  8. 02 Computation using wta Example ✛ ✛ ✛ mean ✵ ✿ ✷✺ ✦ ADJ mean Bob hates ✛ ugly Alice TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  9. 02 Computation using wta Example ✛ ✛ ✛ Bob ✵ ✿ ✺ ✦ NN ADJ ✵ ✿ ✷✺ Bob hates ✛ ugly Alice TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  10. 02 Computation using wta Example ✛ ✛ ✛ ✛ ✵ ✿ ✺ ✦ NP ADJ ✵ ✿ ✷✺ NN ✵ ✿ ✺ hates ✛ ADJ NN ugly Alice TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  11. 02 Computation using wta Example ✛ ◆P ✵ ✿ ✵✻✷✺ ✛ hates ✵ ✿ ✺ ✦ VB hates ✛ ugly Alice TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  12. 02 Computation using wta Example ✛ ◆P ✵ ✿ ✵✻✷✺ ✛ ugly ✵ ✿ ✷✺ ✦ ADJ VB ✵ ✿ ✺ ✛ ugly Alice TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  13. 02 Computation using wta Example ✛ ◆P ✵ ✿ ✵✻✷✺ ✛ Alice ✵ ✿ ✺ ✦ NN VB ✵ ✿ ✺ ✛ ADJ ✵ ✿ ✷✺ Alice TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  14. 02 Computation using wta Example ✛ ◆P ✵ ✿ ✵✻✷✺ ✛ ✛ ✵ ✿ ✺ ✦ NP VB ✵ ✿ ✺ ADJ NN ✛ ADJ ✵ ✿ ✷✺ NN ✵ ✿ ✺ TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  15. 02 Computation using wta Example ✛ ✛ ◆P ✵ ✿ ✵✻✷✺ ✵ ✿ ✺ ✛ ✦ VP VB NP VB ✵ ✿ ✺ ◆P ✵ ✿ ✵✻✷✺ TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  16. 02 Computation using wta Example ✛ ✛ ✵ ✿ ✺ ✦ S ◆P ✵ ✿ ✵✻✷✺ ❱P ✵ ✿ ✵✵✼✽✶✷✺ NP VP TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  17. 02 Computation using wta Example ❙ ✵ ✿ ✵✵✵✷✹✹✶✹✵✻✷✺ So the tree ✛ ✛ ✛ mean Bob hates ✛ ugly Alice is accepted with weight ✵ ✿ ✵✵✵✷✹✹✶✹✵✻✷✺ . TU Dresden, 22 May 2007 Learning deterministic wta slide 8 of 26

  18. 02 Computation using wta (cont’d) Example ✛ Bob Alice ✵ ✿ ✺ ✛ ✦ NN Alice loves TU Dresden, 22 May 2007 Learning deterministic wta slide 9 of 26

  19. 02 Computation using wta (cont’d) Example ✛ Bob loves ✵ ✿ ✺ ✛ ✦ VB NN ✵ ✿ ✺ loves TU Dresden, 22 May 2007 Learning deterministic wta slide 9 of 26

  20. 02 Computation using wta (cont’d) Example ✛ Bob Bob ✵ ✿ ✺ ✛ ✦ NN NN ✵ ✿ ✺ VB ✵ ✿ ✺ TU Dresden, 22 May 2007 Learning deterministic wta slide 9 of 26

  21. 02 Computation using wta (cont’d) Example ✛ NN ✵ ✿ ✺ ✛ ? NN ✵ ✿ ✺ VB ✵ ✿ ✺ TU Dresden, 22 May 2007 Learning deterministic wta slide 9 of 26

  22. 02 Computation using wta (cont’d) Example So the tree ✛ Bob ✛ Alice loves is rejected (accepted with weight ✵ ). TU Dresden, 22 May 2007 Learning deterministic wta slide 9 of 26

  23. 02 Deterministically recognizable Definition A tree series ✥ ✷ ❆ ❤ ❤ ❚ ✝ ✐ ✐ is deterministically recognizable if there exists a deterministic wta accepting ✥ . TU Dresden, 22 May 2007 Learning deterministic wta slide 10 of 26

  24. 03 Table of Contents Notation Weighted tree automaton Myhill-Nerode congruence Learning algorithm An example TU Dresden, 22 May 2007 Learning deterministic wta slide 11 of 26

  25. ✥ ❂ s✐③❡ ❆ ❂ ✭ ❩ ❬ ❢✶❣ ❀ ♠✐♥ ❀ ✰ ❀ ✶ ❀ ✵✮ t ✑ ✉ t❀ ✉ ✷ ❚ ✝ ❛ ❂ s✐③❡✭ ✉ ✮ � s✐③❡✭ t ✮ ❛ ✰ s✐③❡✭ ❝ ❬ t ❪✮ ❂ ❛ ✰ s✐③❡✭ ❝ ✮ � ✶ ✰ s✐③❡✭ t ✮ ❂ s✐③❡✭ ✉ ✮ ✰ s✐③❡✭ ❝ ✮ � ✶ ❂ s✐③❡✭ ❝ ❬ ✉ ❪✮ 03 Definition In the sequel, let ✥ ✷ ❆ ❤ ❤ ❚ ✝ ✐ ✐ with ❆ ❂ ✭ ❆❀ ✰ ❀ ✁ ❀ ✵ ❀ ✶✮ a semifield. Definition (Borchardt ’03) Two trees t❀ ✉ ✷ ❚ ✝ are equivalent if there exists ❛ ✷ ❆ ♥ ❢ ✵ ❣ such that for every context ❝ ✷ ❈ ✝ ❛ ✁ ✭ ✥❀ ❝ ❬ t ❪✮ ❂ ✭ ✥❀ ❝ ❬ ✉ ❪✮ ✿ This equivalence relation is denoted by ✑ . TU Dresden, 22 May 2007 Learning deterministic wta slide 12 of 26

  26. 03 Definition In the sequel, let ✥ ✷ ❆ ❤ ❤ ❚ ✝ ✐ ✐ with ❆ ❂ ✭ ❆❀ ✰ ❀ ✁ ❀ ✵ ❀ ✶✮ a semifield. Definition (Borchardt ’03) Two trees t❀ ✉ ✷ ❚ ✝ are equivalent if there exists ❛ ✷ ❆ ♥ ❢ ✵ ❣ such that for every context ❝ ✷ ❈ ✝ ❛ ✁ ✭ ✥❀ ❝ ❬ t ❪✮ ❂ ✭ ✥❀ ❝ ❬ ✉ ❪✮ ✿ This equivalence relation is denoted by ✑ . Example Let ✥ ❂ s✐③❡ and ❆ ❂ ✭ ❩ ❬ ❢✶❣ ❀ ♠✐♥ ❀ ✰ ❀ ✶ ❀ ✵✮ . Then t ✑ ✉ for every t❀ ✉ ✷ ❚ ✝ because with ❛ ❂ s✐③❡✭ ✉ ✮ � s✐③❡✭ t ✮ ❛ ✰ s✐③❡✭ ❝ ❬ t ❪✮ ❂ ❛ ✰ s✐③❡✭ ❝ ✮ � ✶ ✰ s✐③❡✭ t ✮ ❂ s✐③❡✭ ✉ ✮ ✰ s✐③❡✭ ❝ ✮ � ✶ ❂ s✐③❡✭ ❝ ❬ ✉ ❪✮ TU Dresden, 22 May 2007 Learning deterministic wta slide 12 of 26

  27. ✎ ✥ ✎ ✑ ✑ ✥ 03 Myhill-Nerode theorem Lemma (Borchardt ’03) ✑ is a congruence on ✭ ❚ ✝ ❀ ✝✮ . TU Dresden, 22 May 2007 Learning deterministic wta slide 13 of 26

  28. 03 Myhill-Nerode theorem Lemma (Borchardt ’03) ✑ is a congruence on ✭ ❚ ✝ ❀ ✝✮ . Theorem (Borchardt ’03) The following are equivalent: ✎ ✥ is deterministically recognizable. ✎ ✑ has finite index. Note: The implementation of ✑ yields a minimal deterministic wta accepting ✥ . TU Dresden, 22 May 2007 Learning deterministic wta slide 13 of 26

  29. ✎ ✑ ✑ ❈ ✝ ✑ ❈ ✒ ❈ ✝ ✑ ✑ ❈ ✎ 03 Approximating the Myhill-Nerode relation Definition Let ❈ ✒ ❈ ✝ . Two trees t❀ ✉ ✷ ❚ ✝ are ❈ -equivalent if there exists ❛ ✷ ❆ ♥ ❢ ✵ ❣ such that for every context ❝ ✷ ❈ ❛ ✁ ✭ ✥❀ ❝ ❬ t ❪✮ ❂ ✭ ✥❀ ❝ ❬ ✉ ❪✮ ✿ The ❈ -equivalence relation is denoted by ✑ ❈ . TU Dresden, 22 May 2007 Learning deterministic wta slide 14 of 26

  30. 03 Approximating the Myhill-Nerode relation Definition Let ❈ ✒ ❈ ✝ . Two trees t❀ ✉ ✷ ❚ ✝ are ❈ -equivalent if there exists ❛ ✷ ❆ ♥ ❢ ✵ ❣ such that for every context ❝ ✷ ❈ ❛ ✁ ✭ ✥❀ ❝ ❬ t ❪✮ ❂ ✭ ✥❀ ❝ ❬ ✉ ❪✮ ✿ The ❈ -equivalence relation is denoted by ✑ ❈ . Lemma ✎ ✑ and ✑ ❈ ✝ coincide. ✎ If ✑ has finite index, then there exists finite ❈ ✒ ❈ ✝ such that ✑ and ✑ ❈ coincide. TU Dresden, 22 May 2007 Learning deterministic wta slide 14 of 26

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

The Learning Tree Workshop: The Learning Tree Workshop: Regulating Sensation Series on Learning

The Learning Tree Workshop: The Learning Tree Workshop: Regulating Sensation Series on Learning

The Learning Tree Workshop: The Learning Tree Workshop: Regulating Sensation Series on Learning Differences, Learning Challenges, and Learning Strengths Transcript by Stanley I. Greenspan M.D. Narration by Brian MacDonald Sensory Modulation

453 views • 16 slides
Welcome to Welcome to The Learning Tree Workshop Series on Learning Differences, Learning

Welcome to Welcome to The Learning Tree Workshop Series on Learning Differences, Learning

Welcome to Welcome to The Learning Tree Workshop Series on Learning Differences, Learning Challenges, and Learning Strengths Strengths As a companion to Dr. Greenspans The Learning Tree : g Overcoming Learning Disabilities From the

367 views • 16 slides
The Learning Tree Workshop: The Learning Tree Workshop: Experience-based Learning Series on

The Learning Tree Workshop: The Learning Tree Workshop: Experience-based Learning Series on

The Learning Tree Workshop: The Learning Tree Workshop: Experience-based Learning Series on Learning Differences, Learning Challenges, and Learning Strengths Experience-based Learning: Experience based Learning: Language Build on the

370 views • 14 slides
Recognizable Series on Hypergraphs el Bailly 1 cois Denis 2 Guillaume Rabusseau 2 Rapha Fran

Recognizable Series on Hypergraphs el Bailly 1 cois Denis 2 Guillaume Rabusseau 2 Rapha Fran

Recognizable Series on Hypergraphs el Bailly 1 cois Denis 2 Guillaume Rabusseau 2 Rapha Fran 1 Universit e de Technologie de Compi` egne 2 LIF, CNRS, Aix-Marseille Universit e LATA2015 March 5, 2015 Bailly, Denis, Rabusseau (UTC -

746 views • 47 slides
The Learning Tree Workshop: O Organizing Actions: Motor Planning i i A ti M t Pl i and

The Learning Tree Workshop: O Organizing Actions: Motor Planning i i A ti M t Pl i and

The Learning Tree Workshop: O Organizing Actions: Motor Planning i i A ti M t Pl i and Sequencing Series on Learning Differences, Learning Challenges, and Learning Strengths Why is this so Important? The capacity for motor planning

206 views • 17 slides
Lecture 13 EQ TM is neither recognizable nor co-recognizable M 0 : on any input x, reject x. L(M

Lecture 13 EQ TM is neither recognizable nor co-recognizable M 0 : on any input x, reject x. L(M

Lecture 13 EQ TM is neither recognizable nor co-recognizable M 0 : on any input x, reject x. L(M 0 ) = M 1 : on any input x, accept x. L(M 1 ) = * For any <M,w>, let h(<M,w>) = M 2 be the TM that, on input x, 1. runs M on w

419 views • 13 slides
Relating Tree Series Transducers and Weighted Tree Automata Andreas Maletti December 17, 2004

Relating Tree Series Transducers and Weighted Tree Automata Andreas Maletti December 17, 2004

Relating Tree Series Transducers and Weighted Tree Automata Andreas Maletti December 17, 2004 1. Motivation and Introductory Example 2. Semirings and DM-Monoids 3. Bottom-Up DM-Monoid Weighted Tree Automata 4. Establishing a Relationship 1

329 views • 22 slides
Turing machines Turing Machines (TMs), configurations, yield relation Decidable, recognizable and

Turing machines Turing Machines (TMs), configurations, yield relation Decidable, recognizable and

Turing machines Turing Machines (TMs), configurations, yield relation Decidable, recognizable and co-recognizable languages Computable Functions TM Example Reference: Sipser, Chapter 3 Mihir Bellare, UCSD 1 CSE 200: Computability and Complexity

552 views • 16 slides
Tree Identification Techniques Massachusetts Qualified Tree Warden Course Learning Objectives

Tree Identification Techniques Massachusetts Qualified Tree Warden Course Learning Objectives

Tree Identification Techniques Massachusetts Qualified Tree Warden Course Learning Objectives Recognize why tree ID is important Recognize principles of ID and classification, including binomial nomenclature Identify common tree parts

1.03k views • 79 slides
Decidable and Undecidable Problems 1 Recall: Recognizable vs. Decidable A language L is

Decidable and Undecidable Problems 1 Recall: Recognizable vs. Decidable A language L is

CS311 Computational Structures Decidable and Undecidable Problems 1 Recall: Recognizable vs. Decidable A language L is Turing recognizable if some Turing machine recognizes it. Some strings not in L may cause the TM to loop Turing

804 views • 51 slides
Compositions of Tree Series Transformations Andreas Maletti a Technische Universit at Dresden

Compositions of Tree Series Transformations Andreas Maletti a Technische Universit at Dresden

Compositions of Tree Series Transformations Andreas Maletti a Technische Universit at Dresden Fakult at Informatik D01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de December 03, 2004 1. Motivation 2. Semirings, Tree Series, and

297 views • 18 slides
Compositions of Tree Series Transformations Andreas Maletti Technische Universit at Dresden

Compositions of Tree Series Transformations Andreas Maletti Technische Universit at Dresden

Compositions of Tree Series Transformations Andreas Maletti Technische Universit at Dresden Fakult at Informatik D01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de September 29, 2004 1. Motivation 2. Semirings, Tree Series, and

418 views • 17 slides
Decision Tree and Automata Learning Stefan Edelkamp 1 Overview - Decision tree representation

Decision Tree and Automata Learning Stefan Edelkamp 1 Overview - Decision tree representation

Decision Tree and Automata Learning Stefan Edelkamp 1 Overview - Decision tree representation - Top Down Induction, Attribute Selection - Entropy, Information gain - ID3 learning algorithm - Overfitting - Continous, multi-valued, costly and

718 views • 33 slides
Decision Tree Learning: Part 2 CS 760@UW-Madison Goals for the last lecture you should

Decision Tree Learning: Part 2 CS 760@UW-Madison Goals for the last lecture you should

Decision Tree Learning: Part 2 CS 760@UW-Madison Goals for the last lecture you should understand the following concepts the decision tree representation the standard top-down approach to learning a tree Occams razor

505 views • 38 slides
Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universit at

Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universit at

Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universit at Dresden Fakult at Informatik D01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de May 17, 2005 1. Motivation 2. Semirings, Tree Series,

348 views • 22 slides
ONLINE LEARNING SERIES 2018 ONLINE LEARNING SERIES 2018 LEARNING AND CAPACITY DEVELOPMENT FOR

ONLINE LEARNING SERIES 2018 ONLINE LEARNING SERIES 2018 LEARNING AND CAPACITY DEVELOPMENT FOR

ONLINE LEARNING SERIES 2018 ONLINE LEARNING SERIES 2018 LEARNING AND CAPACITY DEVELOPMENT FOR UNITED NATIONS VOLUNTEERS Marzia Baldassari, Elena Tiurina, Leisan Nazipova Capacity Development team Human Resources Section UNV HQ UPGRADING THE

160 views • 14 slides
P and NP Carola Wenk Slides courtesy of Piotr Indyk with small changes y y g by Carola Wenk

P and NP Carola Wenk Slides courtesy of Piotr Indyk with small changes y y g by Carola Wenk

CS3343 -- Fall 2011 P and NP Carola Wenk Slides courtesy of Piotr Indyk with small changes y y g by Carola Wenk 11/29/11 CS 3343 Analysis of Algorithms 1 We have seen so far Algorithms for various problems Running times O( nm 2

385 views • 36 slides
A Brief Introductory T t Tutorial on Computational i l C t ti l Social Choice Social Choice

A Brief Introductory T t Tutorial on Computational i l C t ti l Social Choice Social Choice

A Brief Introductory T t Tutorial on Computational i l C t ti l Social Choice Social Choice Vincent Conitzer Outline 1. Introduction to voting theory g y 2. Hard-to-compute rules 3 Using computational hardness to prevent

1.21k views • 84 slides
Coupled cluster computations with two-body currents Gaute Hagen Oak Ridge National Laboratory

Coupled cluster computations with two-body currents Gaute Hagen Oak Ridge National Laboratory

Coupled cluster computations with two-body currents Gaute Hagen Oak Ridge National Laboratory SFB1044 workshop: Electromagnetic observables for low-energy nuclear physics Mainz, October 2 nd , 2018 Trend in realistic ab-initio calculations

339 views • 32 slides
Spontaneous B L Breaking as the Origin of the Hot Early Universe Valerie Domcke DESY,

Spontaneous B L Breaking as the Origin of the Hot Early Universe Valerie Domcke DESY,

Spontaneous B L Breaking as the Origin of the Hot Early Universe Valerie Domcke DESY, Hamburg, Germany in collaboration with W. Buchm uller, K. Schmitz, K. Kamada arxiv[hep-ph]: 1202.6679, 1203.0285, 1305.3392 Spontaneous B L

793 views • 21 slides
Observation of Excess Electronic Recoil Events in XENON1T ( KMI &

Observation of Excess Electronic Recoil Events in XENON1T ( KMI &

Observation of Excess Electronic Recoil Events in XENON1T ( KMI & ) @

896 views • 52 slides
GAMMA-RAY PRODUCTION IN MILLISECOND PULSAR BINARY SYSTEMS W lodek Bednarek Department of

GAMMA-RAY PRODUCTION IN MILLISECOND PULSAR BINARY SYSTEMS W lodek Bednarek Department of

. GAMMA-RAY PRODUCTION IN MILLISECOND PULSAR BINARY SYSTEMS W lodek Bednarek Department of Astrophysics The University of Lodz, Poland Considered scenarios for MSPs: Ejection phase Accretor phase Predict high energy radiation

433 views • 25 slides
The millennium question over the reals, the complex numbers and other general structures.

The millennium question over the reals, the complex numbers and other general structures.

Technion, Spring semester 2013 238900-13 The millennium question over the reals, the complex numbers and other general structures. Research seminar 238900-13 Johann A. Makowsky Faculty of Computer Science, Technion - Israel Institute

689 views • 50 slides
Asya Rolls, Damien Colas, Antoine Adamantidis, Matt Carter, Tope Lanre-Amos, H Craig Heller, and

Asya Rolls, Damien Colas, Antoine Adamantidis, Matt Carter, Tope Lanre-Amos, H Craig Heller, and

3/11/2013 Optogenetic Manipulation of Sleep Continuity Impairs Memory Consolidation Asya Rolls, Damien Colas, Antoine Adamantidis, Matt Carter, Tope Lanre-Amos, H Craig Heller, and Luis de Lecea Presented by Brian Jacobs and Sam Doernberg

235 views • 4 slides

More recommend