simultaneous nearest neighbor search
play

Simultaneous Nearest Neighbor Search Piotr Indyk Robert Kleinberg - PowerPoint PPT Presentation

Oct 03, 2022 β€’184 likes β€’883 views

Simultaneous Nearest Neighbor Search Piotr Indyk Robert Kleinberg MIT Cornell Sepideh Mahabadi Yang Yuan MIT Cornell Nearest Neighbor Dataset of points in a metric space (, ) 6/17/2016 2 Nearest Neighbor

  1. Simultaneous Nearest Neighbor Search Piotr Indyk Robert Kleinberg MIT Cornell Sepideh Mahabadi Yang Yuan MIT Cornell

  2. Nearest Neighbor β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) 6/17/2016 2

  3. Nearest Neighbor β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ A query point comes online π‘Ÿ π‘Ÿ 6/17/2016 3

  4. Nearest Neighbor β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ A query point comes online π‘Ÿ π‘Ÿ β€’ Goal: π‘ž βˆ— β€’ Find the nearest data-set point π‘ž βˆ— 6/17/2016 4

  5. Nearest Neighbor β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ A query point comes online π‘Ÿ π‘Ÿ β€’ Goal: π‘ž βˆ— β€’ Find the nearest data-set point π‘ž βˆ— β€’ Do it in sub-linear time 6/17/2016 5

  6. Approximate Nearest Neighbor β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ A query point comes online π‘Ÿ π‘ž π‘Ÿ β€’ Goal: π‘ž βˆ— β€’ Find the nearest data-set point π‘ž βˆ— β€’ Do it in sub-linear time β€’ Approximate Nearest Neighbor 6/17/2016 6

  7. What if We have multiple queries We need the results of the queries to be related. 6/17/2016 7

  8. What if We have multiple queries We need the results of the queries to be related. Example: β€’ Noisy image β€’ For each pixel find the true color β€’ Neighboring pixels have similar color 6/17/2016 8

  9. Simultaneous NN Problem 6/17/2016 Sepideh Mahabadi 9

  10. The SNN problem ( Felzenszwalb’15) β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) 6/17/2016 10

  11. The SNN problem ( Felzenszwalb’15) β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ Query comes online and contains π‘Ÿ 2 β€’ 𝑙 query points 𝑅 = (π‘Ÿ 1 , … , π‘Ÿ 𝑙 ) π‘Ÿ 3 π‘Ÿ 1 6/17/2016 11

  12. The SNN problem ( Felzenszwalb’15) β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ Query comes online and contains π‘Ÿ 2 β€’ 𝑙 query points 𝑅 = (π‘Ÿ 1 , … , π‘Ÿ 𝑙 ) π‘Ÿ 3 π‘Ÿ 1 β€’ A compatibility graph 𝐻 = 𝑅, 𝐹 𝐻 6/17/2016 12

  13. The SNN problem ( Felzenszwalb’15) β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ Query comes online and contains π‘Ÿ 2 β€’ 𝑙 query points 𝑅 = (π‘Ÿ 1 , … , π‘Ÿ 𝑙 ) π‘Ÿ 3 π‘Ÿ 1 β€’ A compatibility graph 𝐻 = 𝑅, 𝐹 𝐻 6/17/2016 13

  14. The SNN problem (Felzenszwalb’15) β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) β€’ Query comes online and contains π‘Ÿ 2 β€’ 𝑙 query points 𝑅 = (π‘Ÿ 1 , … , π‘Ÿ 𝑙 ) π‘Ÿ 3 π‘Ÿ 1 β€’ A compatibility graph 𝐻 = 𝑅, 𝐹 𝐻 6/17/2016 14

  15. The SNN problem ( Felzenszwalb’15) β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) π‘ž 3 β€’ Query comes online and contains π‘ž 2 π‘Ÿ 2 β€’ 𝑙 query points 𝑅 = (π‘Ÿ 1 , … , π‘Ÿ 𝑙 ) π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 β€’ A compatibility graph 𝐻 = 𝑅, 𝐹 𝐻 β€’ Goal is to report (π‘ž 1 , … , π‘ž 𝑙 ) , π‘ž 𝑗 ∈ 𝑄 , that minimizes 𝒍 𝒋=𝟐 𝒆 𝒀 (𝒓 𝒋 , 𝒒 𝒋 ) + 𝒓 𝒋 ,𝒓 π’Œ βˆˆπ‘­ 𝑯 𝒆 𝒀 (𝒒 𝒋 , 𝒒 π’Œ ) 6/17/2016 15

  16. The Generalized SNN β€’ Dataset of π‘œ points 𝑄 in a metric space (π‘Œ, 𝑒 π‘Œ ) π‘ž 3 β€’ Query comes online and contains π‘ž 2 π‘Ÿ 2 β€’ 𝑙 query points 𝑅 = (π‘Ÿ 1 , … , π‘Ÿ 𝑙 ) π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 β€’ A compatibility graph 𝐻 = 𝑅, 𝐹 𝐻 β€’ Goal is to report (π‘ž 1 , … , π‘ž 𝑙 ) , π‘ž 𝑗 ∈ 𝑄 , that minimizes 𝒍 𝒋=𝟐 𝝀 𝒋 𝑒 𝒁 (𝒓 𝒋 , 𝒒 𝒋 ) + 𝒓 𝒋 ,𝒓 π’Œ βˆˆπ‘­ 𝑯 𝝁 𝒋,π’Œ 𝒆 𝒀 (𝒒 𝒋 , 𝒒 π’Œ ) 6/17/2016 16

  17. Independent NN Algorithm 6/17/2016 Sepideh Mahabadi 17

  18. Independent NN Algorithm INN Algorithm β€’ For each query point π‘Ÿ 𝑗 ∈ 𝑅 π‘Ÿ 2 π‘Ÿ 3 π‘Ÿ 1 6/17/2016 18

  19. Independent NN Algorithm INN Algorithm β€’ For each query point π‘Ÿ 𝑗 ∈ 𝑅 β€’ Independently find a (approximate) nearest neighbor 𝒒 𝒋 (Searching step) π‘ž 2 π‘Ÿ 2 π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 π‘ž 3 6/17/2016 19

  20. Independent NN Algorithm INN Algorithm β€’ For each query point π‘Ÿ 𝑗 ∈ 𝑅 β€’ Independently find a (approximate) nearest neighbor 𝒒 𝒋 (Searching step) β€’ Replace the label set 𝑄 with the reduced set 𝑸 = { 𝒒 𝟐 , … , 𝒒 𝒍 } (Pruning step) π‘ž 2 π‘Ÿ 2 π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 π‘ž 3 6/17/2016 20

  21. Independent NN Algorithm INN Algorithm β€’ For each query point π‘Ÿ 𝑗 ∈ 𝑅 β€’ Independently find a (approximate) nearest neighbor 𝒒 𝒋 (Searching step) β€’ Replace the label set 𝑄 with the reduced set 𝑸 = { 𝒒 𝟐 , … , 𝒒 𝒍 } (Pruning step) β€’ Solve the problem for 𝑄 π‘ž 2 π‘Ÿ 2 π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 π‘ž 3 6/17/2016 21

  22. Independent NN Algorithm INN Algorithm β€’ For each query point π‘Ÿ 𝑗 ∈ 𝑅 β€’ Independently find a (approximate) nearest neighbor 𝒒 𝒋 (Searching step) β€’ Replace the label set 𝑄 with the reduced set 𝑸 = { 𝒒 𝟐 , … , 𝒒 𝒍 } (Pruning step) β€’ Solve the problem for 𝑄 π‘ž 2 π‘Ÿ 2 οƒ˜ Reduces the size of labels from π‘œ down to 𝑙 π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 π‘ž 3 6/17/2016 22

  23. Independent NN Algorithm INN Algorithm β€’ For each query point π‘Ÿ 𝑗 ∈ 𝑅 β€’ Independently find a (approximate) nearest neighbor 𝒒 𝒋 (Searching step) β€’ Replace the label set 𝑄 with the reduced set 𝑸 = { 𝒒 𝟐 , … , 𝒒 𝒍 } (Pruning step) β€’ Solve the problem for 𝑄 π‘ž 2 π‘Ÿ 2 οƒ˜ Reduces the size of labels from π‘œ down to 𝑙 π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 π‘ž 3 οƒ˜ The optimal value increases by a factor 𝜷 οƒ˜ pruning gap 6/17/2016 23

  24. Independent NN Algorithm INN Algorithm β€’ For each query point π‘Ÿ 𝑗 ∈ 𝑅 β€’ Independently find a (approximate) nearest neighbor 𝒒 𝒋 (Searching step) β€’ Replace the label set 𝑄 with the reduced set 𝑸 = { 𝒒 𝟐 , … , 𝒒 𝒍 } (Pruning step) β€’ Solve the problem for 𝑄 π‘ž 2 π‘Ÿ 2 οƒ˜ Reduces the size of labels from π‘œ down to 𝑙 π‘Ÿ 3 π‘ž 1 π‘Ÿ 1 π‘ž 3 οƒ˜ The optimal value increases by a factor 𝜷 οƒ˜ pruning gap οƒ˜ Any metric labeling 𝛾 -approximate algorithm can be used on the reduced set , giving us (𝛽 β‹… 𝛾) -approximate algorithm. 6/17/2016 24

  25. Results 6/17/2016 Sepideh Mahabadi 25

  26. Results β€’ Prove bounds for the pruning gap 6/17/2016 26

  27. Results β€’ Prove bounds for the pruning gap 𝐦𝐩𝐑 𝒍 β€’ 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 π₯ 6/17/2016 27

  28. Results β€’ Prove bounds for the pruning gap 𝐦𝐩𝐑 𝒍 β€’ 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 π₯ β€’ 𝜷 = 𝛁 𝐦𝐩𝐑 𝒍 6/17/2016 28

  29. Results β€’ Prove bounds for the pruning gap 𝐦𝐩𝐑 𝒍 β€’ 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 π₯ β€’ 𝜷 = 𝛁 𝐦𝐩𝐑 𝒍 β€’ For 𝑠 -sparse graph: 𝜷 = 𝑷 𝒔 6/17/2016 29

  30. Results β€’ Prove bounds for the pruning gap 𝐦𝐩𝐑 𝒍 β€’ 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 π₯ β€’ 𝜷 = 𝛁 𝐦𝐩𝐑 𝒍 β€’ For 𝑠 -sparse graph: 𝜷 = 𝑷 𝒔 β€’ Graphs with pseudo-arboricity 𝑠 : each edge can be mapped to a vertex such that at most 𝑠 edges are mapped to any vertex 6/17/2016 30

  31. Results β€’ Prove bounds for the pruning gap 𝐦𝐩𝐑 𝒍 β€’ 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 π₯ β€’ 𝜷 = 𝛁 𝐦𝐩𝐑 𝒍 β€’ For 𝑠 -sparse graph: 𝜷 = 𝑷 𝒔 β€’ Graphs with pseudo-arboricity 𝑠 : each edge can be mapped to a vertex such that at most 𝑠 edges are mapped to any vertex β€’ Would mean constant approximation factor for trees, grids, planar graphs , …, and in particular 𝑃(𝑠) -approximation for 𝑠 - degree graphs 6/17/2016 31

  32. Results β€’ Prove bounds for the pruning gap 𝐦𝐩𝐑 𝒍 β€’ 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 π₯ β€’ 𝜷 = 𝛁 𝐦𝐩𝐑 𝒍 β€’ For 𝑠 -sparse graph: 𝜷 = 𝑷 𝒔 β€’ Graphs with pseudo-arboricity 𝑠 : each edge can be mapped to a vertex such that at most 𝑠 edges are mapped to any vertex β€’ Would mean constant approximation factor for trees, grids, planar graphs , …, and in particular 𝑃(𝑠) -approximation for 𝑠 - degree graphs β€’ 𝜷 is very close to one in experiments 6/17/2016 32

  33. Results β€’ Prove bounds for the pruning gap 𝐦𝐩𝐑 𝒍 β€’ 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 π₯ β€’ 𝜷 = 𝛁 𝐦𝐩𝐑 𝒍 β€’ For 𝑠 -sparse graph: 𝜷 = 𝑷 𝒔 β€’ Graphs with pseudo-arboricity 𝑠 : each edge can be mapped to a vertex such that at most 𝑠 edges are mapped to any vertex β€’ Would mean constant approximation factor for trees, grids, planar graphs , …, and in particular 𝑃(𝑠) -approximation for 𝑠 - degree graphs β€’ 𝜷 is very close to one in experiments 6/17/2016 33

  34. Overview of the proof for 𝐦𝐩𝐑 𝒍 𝜷 = 𝑷 𝐦𝐩𝐑 𝐦𝐩𝐑 𝒍 6/17/2016 Sepideh Mahabadi 34

  35. 0-Extension Problem [Kar98] 6/17/2016 35

  36. 0-Extension Problem [Kar98] β€’ The input: β€’ a graph 𝐼 π‘Š, 𝐹 6/17/2016 36

  37. 0-Extension Problem [Kar98] β€’ The input: β€’ a graph 𝐼 π‘Š, 𝐹 β€’ a weight function π‘₯ 𝑓 1 2 2 1 2 6/17/2016 37

  38. 0-Extension Problem [Kar98] β€’ The input: β€’ a graph 𝐼 π‘Š, 𝐹 β€’ a weight function π‘₯ 𝑓 β€’ a set of terminals π‘ˆ βŠ‚ π‘Š 1 2 2 1 2 6/17/2016 38

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

High-Dimensional Nearest Neighbor Search High-Dimensional Nearest Neighbor Search Who?

High-Dimensional Nearest Neighbor Search High-Dimensional Nearest Neighbor Search Who?

High-Dimensional Nearest Neighbor Search High-Dimensional Nearest Neighbor Search Who? About Cliqz and me What? Problem statement Why? Applications How? Exact solutions in low dimensions Approximate

690 views β€’ 19 slides
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search Sariel Har-Peled

Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search Sariel Har-Peled

Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search Sariel Har-Peled Sepideh Mahabadi UIUC MIT Nearest Neighbor Problem Nearest Neighbor Dataset of points in a metric space (, ) , e.g.

967 views β€’ 81 slides
Data-dependent Hashing for Nearest Neighbor Search Alex Andoni (Columbia University) Based on

Data-dependent Hashing for Nearest Neighbor Search Alex Andoni (Columbia University) Based on

Data-dependent Hashing for Nearest Neighbor Search Alex Andoni (Columbia University) Based on joint work with: Piotr Indyk, Huy Nguyen, Ilya Razenshteyn Nearest Neighbor Search (NNS) Preprocess: a set of points Query: given a

542 views β€’ 19 slides
CSCI 447/547 MACHINE LEARNING Outline Nearest Neighbor K-Nearest Neighbor Algorithm

CSCI 447/547 MACHINE LEARNING Outline Nearest Neighbor K-Nearest Neighbor Algorithm

Nearest Neighbor CSCI 447/547 MACHINE LEARNING Outline Nearest Neighbor K-Nearest Neighbor Algorithm Note: Slides were adapted from David Sontag, New York University (who adapted them from Vibhav Gogate, Carlos Questrin, Mehryar

200 views β€’ 16 slides
Continuous Nearest Neighbor Search Yufei Tao, Dimitris Papadias, Qiongmao Shen Hong Kong

Continuous Nearest Neighbor Search Yufei Tao, Dimitris Papadias, Qiongmao Shen Hong Kong

Continuous Nearest Neighbor Search Yufei Tao, Dimitris Papadias, Qiongmao Shen Hong Kong University of Science and Technology Clear Water Bay, Hong Kong 1 Point Nearest Neighbor (NN) Queries [Roussopoulos et al SIGMOD95, Hjaltason and Samet

237 views β€’ 22 slides
Nearest Neighbor Classification Machine Learning 1 This lecture K-nearest neighbor

Nearest Neighbor Classification Machine Learning 1 This lecture K-nearest neighbor

Nearest Neighbor Classification Machine Learning 1 This lecture K-nearest neighbor classification The basic algorithm Different distance measures Some practical aspects Voronoi Diagrams and Decision Boundaries What is the

893 views β€’ 57 slides
Simple and Fast Nearest Neighbor Search Marcel Birn, Manuel Holtgrewe, Peter Sanders , Johannes

Simple and Fast Nearest Neighbor Search Marcel Birn, Manuel Holtgrewe, Peter Sanders , Johannes

Birn et al.: Nearest Neighbors 1 Simple and Fast Nearest Neighbor Search Marcel Birn, Manuel Holtgrewe, Peter Sanders , Johannes Singler Birn et al.: Nearest Neighbors 2 2D Nearest Neighbor Search Preprocess S = { ( x 1 , y 1 ) , . . . , ( x

201 views β€’ 19 slides
Graph-based Nearest Neighbor Search: From Practice to Theory Liudmila Prokhorenkova, Aleksandr

Graph-based Nearest Neighbor Search: From Practice to Theory Liudmila Prokhorenkova, Aleksandr

Graph-based Nearest Neighbor Search: From Practice to Theory Liudmila Prokhorenkova, Aleksandr Shekhovtsov ICML 2020 Liudmila Prokhorenkova Graph-based Nearest Neighbor Search ICML 2020 1 / 16 Nearest neighbor search Dataset D = { x 1 , . .

578 views β€’ 33 slides
Learning From Data Lecture 16 Similarity and Nearest Neighbor Similarity Nearest Neighbor M.

Learning From Data Lecture 16 Similarity and Nearest Neighbor Similarity Nearest Neighbor M.

Learning From Data Lecture 16 Similarity and Nearest Neighbor Similarity Nearest Neighbor M. Magdon-Ismail CSCI 4100/6100 My 5-Year-Old Called It A ManoHorse The simplest method of learning that we know. Classify according to similar

331 views β€’ 16 slides
recap: Data Condensation and Nearest Neighbor Search Training Set Consistent S 2 Learning From

recap: Data Condensation and Nearest Neighbor Search Training Set Consistent S 2 Learning From

recap: Data Condensation and Nearest Neighbor Search Training Set Consistent S 2 Learning From Data Branch and bound for finding Lecture 18 nearest neighbors. x Radial Basis Functions S 1 Non-Parametric RBF Parametric RBF k

795 views β€’ 8 slides
Extremely low bit-rate nearest neighbor search using a Set Compression Tree Relja Arandjelovi

Extremely low bit-rate nearest neighbor search using a Set Compression Tree Relja Arandjelovi

Extremely low bit-rate nearest neighbor search using a Set Compression Tree Relja Arandjelovi and Andrew Zisserman Department of Engineering Science, University of Oxford Introduction Many computer vision / machine learning systems rely on

642 views β€’ 47 slides
Sublinear Time Nearest Neighbor Search over Generalized Weighted Space Yifan Lei

Sublinear Time Nearest Neighbor Search over Generalized Weighted Space Yifan Lei

Sublinear Time Nearest Neighbor Search over Generalized Weighted Space Yifan Lei Mohan S. Kankanhalli Anthony K. H. Tung School of Computing, National University of Singapore Source code:

514 views β€’ 10 slides
BAYES AND NEAREST NEIGHBOR BAYES AND NEAREST NEIGHBOR CLASSIFIERS CLASSIFIERS Matthieu R Bloch

BAYES AND NEAREST NEIGHBOR BAYES AND NEAREST NEIGHBOR CLASSIFIERS CLASSIFIERS Matthieu R Bloch

BAYES AND NEAREST NEIGHBOR BAYES AND NEAREST NEIGHBOR CLASSIFIERS CLASSIFIERS Matthieu R Bloch Tuesday, January 21, 2020 1 LOGISTICS LOGISTICS TAs and Office hours Monday: Mehrdad (TSRB 523a) - 2pm-3:15pm Tuesday: TJ (VL C449 Cubicle D) -

362 views β€’ 12 slides
9/28/2009 Nearest Neighbor Queries What are the two nearest stars to Andromeda? Reverse

9/28/2009 Nearest Neighbor Queries What are the two nearest stars to Andromeda? Reverse

9/28/2009 Nearest Neighbor Queries What are the two nearest stars to Andromeda? Reverse kNNsearch in Arbitrary Dimensionality Where is the nearest restaurant? Seyed Jalal Kazemitabar Original paper by Y. Tao, D. Papadias, and X. Lian Where

228 views β€’ 6 slides
NEAREST NEIGHBOR RULE Jeff Robble, Brian Renzenbrink, Doug Roberts Nearest Neighbor Rule

NEAREST NEIGHBOR RULE Jeff Robble, Brian Renzenbrink, Doug Roberts Nearest Neighbor Rule

NEAREST NEIGHBOR RULE Jeff Robble, Brian Renzenbrink, Doug Roberts Nearest Neighbor Rule Consider a test point x. x is the closest point to x out of the rest of the test points. Nearest Neighbor Rule selects the class for x with the

573 views β€’ 33 slides
Nearest neighbor methods Lecture 11 David Sontag New York

Nearest neighbor methods Lecture 11 David Sontag New York

Nearest neighbor methods Lecture 11 David Sontag New York University Slides adapted from Vibhav Gogate, Carlos Guestrin, Mehryar Mohri, & Luke Zettlemoyer Nearest Neighbor Algorithm

311 views β€’ 20 slides
APT: A Practical Transit-Mapping Service Dan Jen, Michael Meisel, Dan Massey, Lan Wang, Beichuan

APT: A Practical Transit-Mapping Service Dan Jen, Michael Meisel, Dan Massey, Lan Wang, Beichuan

APT: A Practical Transit-Mapping Service Dan Jen, Michael Meisel, Dan Massey, Lan Wang, Beichuan Zhang, and Lixia Zhang Motivation The current BGP routing system doesnt scale Router hardware may not be able to keep up The conflict

819 views β€’ 45 slides
Explicit Rewriting Franois-Rgis Sinot LIX, cole Polytechnique, France Projet Logical:

Explicit Rewriting Franois-Rgis Sinot LIX, cole Polytechnique, France Projet Logical:

Explicit Rewriting Franois-Rgis Sinot LIX, cole Polytechnique, France Projet Logical: PCRI, CNRS, EP , INRIA, UPS Workshop on the -calculus, 2005 Ladies and gentlemen. . . take a TRS R = { l i r i } i on = { f , . . . }

811 views β€’ 43 slides
4D Topological Physics with Synthetic Dimensions Hannah Price University of Birmingham, UK

4D Topological Physics with Synthetic Dimensions Hannah Price University of Birmingham, UK

4D Topological Physics with Synthetic Dimensions Hannah Price University of Birmingham, UK Synthetic Dimensions General Concept: 1. Identify a set of states and reinterpret as sites in a synthetic dimension 0 1 2 3 4 2. Couple these

717 views β€’ 27 slides
The Termination Competition Claude March e Hans Zantema Orsay, France Eindhoven, The

The Termination Competition Claude March e Hans Zantema Orsay, France Eindhoven, The

Termination Competition The Termination Competition Claude March e Hans Zantema Orsay, France Eindhoven, The Netherlands June 26th, 2007 Termination Competition Short history WST03, Valencia: initiated by Albert Rubio

476 views β€’ 13 slides
Hands On(line) Lab Education with Remote SEM Zachary Gray RAIN Network Partners Bob Ehrmann

Hands On(line) Lab Education with Remote SEM Zachary Gray RAIN Network Partners Bob Ehrmann

Hands On(line) Lab Education with Remote SEM Zachary Gray RAIN Network Partners Bob Ehrmann Ozgur Cakmak This webinar is hosted by: Nanotechnology Application and Career Knowledge (NACK CK) is a National Science Foundation (NSF) Advanced

330 views β€’ 32 slides
On the Defense Against Adversarial Examples Beyond the Visible Spectrum Anthony Ortiz 1 , Olac

On the Defense Against Adversarial Examples Beyond the Visible Spectrum Anthony Ortiz 1 , Olac

On the Defense Against Adversarial Examples Beyond the Visible Spectrum Anthony Ortiz 1 , Olac Fuentes 1 , Dalton Rosario 2 , Christopher Kiekintveld 1 1 Department of Computer Science, UTEP 2 US Army Research Laboratory Adversarial Examples on

460 views β€’ 19 slides
GNR607 Principles of Satellite Image Processing Instructor: Prof. B. Krishna Mohan CSRE, IIT

GNR607 Principles of Satellite Image Processing Instructor: Prof. B. Krishna Mohan CSRE, IIT

GNR607 Principles of Satellite Image Processing Instructor: Prof. B. Krishna Mohan CSRE, IIT Bombay bkmohan@csre.iitb.ac.in Slot 2 Lecture 32-34 Principal Component Transform and Band Arithmetic October 14, 2014 10.35 AM 11.30

840 views β€’ 68 slides
Theory of Computation Chapter 10: coNP Guan-Shieng Huang Nov. 22, 2006 0-0 coNP

Theory of Computation Chapter 10: coNP Guan-Shieng Huang Nov. 22, 2006 0-0 coNP

Theory of Computation Chapter 10: coNP Guan-Shieng Huang Nov. 22, 2006 0-0 coNP A problem is in coNP iff its complement is in NP. The complement of a decision problem is to interchange the yes/no answer for each

335 views β€’ 32 slides

More recommend