Approximate Nearest Neighbor for Curves  Simple, Efficient, and Deterministic
Video in TIB AVPortal:
Approximate Nearest Neighbor for Curves  Simple, Efficient, and Deterministic
Formal Metadata
Title 
Approximate Nearest Neighbor for Curves  Simple, Efficient, and Deterministic

Subtitle 
Q/A Session A  Paper A1.E

Title of Series  
Author 

Contributors 

License 
CC Attribution 3.0 Germany:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor. 
Identifiers 

Publisher 

Release Date 
2020

Language 
English

Content Metadata
Subject Area 
Related Material
Video is accompanying material for the following resource
00:00
Sic
Curve
Determinism
output
Neuroinformatik
Data structure
Distance
Approximation
00:26
Curve
Group action
Multiplication sign
Curve
Distance
Demoscene
Approximation
Revision control
Normed vector space
Query language
Convex hull
Endliche Modelltheorie
Dean number
Scalable Coherent Interface
01:04
Curve
Decision theory
Curve
Artificial neural network
Distance
Approximation
Product (business)
Revision control
Computer cluster
Term (mathematics)
Query language
IRIST
Reduction of order
02:13
Point (geometry)
Curve
Multiplication sign
Curve
1 (number)
Sequence
Position operator
Thomas Bayes
Sequence
02:44
Point (geometry)
Different (Kate Ryan album)
Cellular automaton
Curve
Subject indexing
Total S.A.
Line (geometry)
Distance
Position operator
Number
Sequence
03:30
Point (geometry)
CAN bus
Data flow diagram
Curve
Maxima and minima
Maxima and minima
Open set
Distance
Descriptive statistics
Distance
04:00
Netbook
Multiplication sign
Curve
Maxima and minima
Distance
Computer programming
Approximation
Distance
Process (computing)
Angle
Data flow diagram
Family
Condition number
04:29
Sensitivity analysis
Metric system
Multiplication sign
Curve
Artificial neural network
Numbering scheme
Distance
Approximation
Neuroinformatik
Data flow diagram
Query language
Spacetime
Metropolitan area network
Potenz <Mathematik>
Point (geometry)
Numbering scheme
Approximation
Distance
Product (business)
Digital photography
Process (computing)
Integrated development environment
System on a chip
output
Local ring
Spacetime
06:36
Point (geometry)
Potenz <Mathematik>
Metric system
Multiplication sign
Curve
Data storage device
Infinity
Basis <Mathematik>
Numbering scheme
Distance
Approximation
Product (business)
Product (business)
Neuroinformatik
Extreme programming
System on a chip
Data flow diagram
Query language
Spacetime
Data structure
Spacetime
07:56
Curve
Uniform convergence
Set (mathematics)
Graph coloring
Neuroinformatik
Usability
Roundness (object)
Data flow diagram
Query language
Square number
output
Vertex (graph theory)
Data structure
Metropolitan area network
Form (programming)
08:56
Point (geometry)
Cellular automaton
Multiplication sign
Point (geometry)
Curve
Planning
Set (mathematics)
Distance
Mereology
Sequence
Inequality (mathematics)
Number
Usability
Goodness of fit
Causality
Computer configuration
Queue (abstract data type)
Traffic reporting
12:01
Point (geometry)
Goodness of fit
40 (number)
Multiplication sign
Point (geometry)
Total S.A.
Total S.A.
Number
Neuroinformatik
12:33
Point (geometry)
Curve
Implementation
Multiplication sign
Point (geometry)
Curve
Set (mathematics)
Counting
Total S.A.
Total S.A.
Usability
Number
Wave packet
Computer configuration
Personal digital assistant
Term (mathematics)
Cube
Data structure
Freeware
14:43
Multiplication sign
Constructor (objectoriented programming)
Curve
Image warping
Set (mathematics)
Maxima and minima
Extreme programming
Instance (computer science)
Distance
System call
Goodness of fit
Voting
Computer configuration
Network topology
Computer configuration
System on a chip
Order (biology)
Normal (geometry)
Summierbarkeit
Aerodynamics
Implementation
Family
Mathematical optimization
Descriptive statistics
16:00
Data flow diagram
Curve
Image warping
Aerodynamics
Distance
Similarity (geometry)
16:23
Point (geometry)
Planning
Parameter (computer programming)
Maxima and minima
Bound state
Distance
Inequality (mathematics)
Similarity (geometry)
Spacetime
Squeeze theorem
Family
Form (programming)
Social class
17:29
Potenz <Mathematik>
Observational study
Multiplication sign
Cellular automaton
Set (mathematics)
Planning
Approximation
Number
Neuroinformatik
Personal digital assistant
Data flow diagram
Query language
output
Spacetime
Extension (kinesiology)
Extension (kinesiology)
18:35
Addition
Logical constant
Polynomial
Observational study
Multiplication sign
Adaptive behavior
Curve
Range (statistics)
Counting
Bound state
Approximation
Open set
Approximation
Number
Query language
output
Spacetime
Data structure
output
Spacetime
Extension (kinesiology)
19:50
Polynomial
Logical constant
Spacetime
Bound state
Approximation
Open set
00:05
the.
00:11
hi my name is always been so and i will talk about the proximate mills mobile phone full gets this is a giant wall with ahmed fear itself and markets and. and some have a massive deficit of mary want to arrange them in some data structure such did given worker you can quickly find a lost her from of inputs.
00:39
let him know that our data set by a scene that then to be some distance model for corrupt and cured in also quell.
00:49
india must never problem our goal east to process to set see such they're given quirkier in canada and include curve the star which is the closest to you. but can also concern approximation version of this problem but the goal is to be done until the with in this dance one plus action on times the distance to the nearest neighbor.
01:15
for to sell their books to measure merchant we can just consider a decision version of the problem in which are also given a distance pamuk there are the current been based he's used to the third sister killed been dataset within this and our few men were term some curves p.. the prime within their stance one perception on now. i and the most efficient production between the proclamation problem and the approximate decision problem and therefore we can focus on the decision problem. before talking about the nearest neighbor upon them we first need to define our distance mental focus and for their that's first talk about terrorism.
02:07
consider also probably not cursed a and b. both of land and.
02:13
now imagine to for the effort is standing on the first red white and the bay for his standing on the first look point. they keep poking from point to point and ownership ones each time you know the a frog to be for both have exactly one step for all they continue until they reach the and point of the active sequences.
02:43
another time and how is a sequence of positions spoke person in the access that describes to move manned have to do for books and on the curve.
02:55
every and i am and start with a position one one and answer in the position and and. which in excess of the start line and and in point. natixis in each cell can increase their most one can burn to the earliest the. it isn't easy exercise to check their the total number of different carolina and ease down and by two to two and.
03:29
there are also a friend distance measure us that are based on the stairwell and.
03:38
fota open and cursed a in be each we need a mention on points if women in my is over all possible and i'm the maximum distance between the frocks then we get the description distance.
03:58
if instead of my when minimize to self distances between the frog then we get them a crime or can.
04:09
but if distances between two care scam be completed in one that time using the sink and anaemic or them an angle of them and funded is great for said his times their existing condition and lower on show in that's family support article in them is unlikely to exist. but that did approximate nurse netbook from them we called our goal is to clear process said see of and cursed such they're given a coworker q if the this care fee the within the stands out you barely want to than.
04:49
a healthy prime minister since one perception on how. in general women for just four solution. the first bond easy not doing any process just talk to set see and let the quality of all of them do all the war. but then our with need a quiet time you see. second one is to put computers and then store the answers to a dish fertilization of all possible yes quell he is and they have worries i mean that they have some input care close enough to them. and the quiet who them. just do a quick look up to get the answer. and then obviously in a space mom will be large. but how artists will be. the first to stand in this problem another the first to shed his sons was indeed in two thousand and two he used idea of what matter and it got a constant approximation with quite time born in namibia in animals and.
06:04
the space man is exponentially him and depends on the size of the main on which occurs are defined. then on in two thousand and seventeen drummer and so mostly was under the locality sensitive hudgens scheme for health and a little distance the importers out of india for shock to us but vote space and called time exponential in m. and. the proclamation photo is for pneumonia in be. a year later in their his and terrace managed to obtain own perception on trucks emission truck so their idea was to try all the possible environment which is why the quality time is still on in china.
06:52
one is then i'm in this fixed the problem can billion dollars to two been ill neighbor problem for points in an infinity product of his basis. as you can see all these data structures have been an exponential in employer time all and even the most stores based on. in our actually take the extreme boat of the computing and is that these asian of all they ask well is to go on plus example commission.
07:27
suppressing not only we get an initial quality time but were also significantly including the space bound of the luckiest was up. it is also interesting to note that the koran time is significantly smaller than the lower bound for computer new distance because it means that very find cautious of assertion is most sensitive them fine and. the basic idea an outpost he is as for.
08:02
stop the end in a form gleaned over the input when as land rover square with the. then a computer said i have great.
08:16
seventeen all the possible yes qualities. and story answers for all the colors in the set that. now been an aquatic you just snap it's fair to say this to me. and this can be simply man by round and we get a grip care you have. he and the guarantee ease didn't if using his career he then you have is in the set i am concerned the crew can get an answer. and so how do we choose to set of greed care costs.
09:02
for one care p. in the data set the not by i have the the set of all richer that are within this turns one plus will tilt and how. and that's all for simplicity from now on their equals one. so the part of the oscars in the sequence of course of freddie used one plus abstinent to round up points. i for work of q what are we the distance between show and the rounded you have. cells cells their member of the grid and engineers ease of criminal the we get to the distance between a point of queue to close a straight point is that most of them over to. that means there and others could shake his hand which is their maximum over or cursed in anaheim and the distance between q and you have is its most absent on over to because we can just match each point to the closest report. the cause of the choir i'm now falls from the plan in quality because if you ease a yes squarely in the distance between human p is most one and then abandoned haven't quite the distance between few hat and he is most one plus next. it also which means that you have is in the set i speak. so did they have a structural. hell with this turns and must one plus absurd number so to you have. and this care will be and distance and must one plus up their own to queue.
11:12
but how many great care of their in i've be. the number of good points in number of twenty first one perception. to ease off while we're on to the and again the points of those repairs are contained in this sequence of bush what is one perception among will to amount of points off peak. but that can be many different options to choose the point of a great career that has these distance to peak. something else can have many points in the first book. other can have on the one point in the first two boys. i don't know if i want to point his end times the size of one more.
12:06
and navy dinamo a good health is bound and by this number to the poll found. i can look at the belmont by county moko forty. and then a true can get one over on to the empty and that we can also computer i have seen this time.
12:32
and so not in the number of good points in one bore his own a loaf one of work soon to be and a total number of carol ammons e's two to two m..
12:45
let's fix and i'm and tell. now we ask how many vehicles. from be when using our monument top. i am so for example entered our i meant is as follows.
13:05
and now we need to pick a great care for all the said i p. we have to pick the first four in q one from the on the one. and cujo from the bond peto that point you're training and lies in the intersection of both the one on the train the mormon before and no one on the five. that were also have to do over counting and shows cube tray. from them from one of them say the bar on the free. so the counting is constructed so each case from one two am we peak uk which is a cane on of the critical. from the world need g. for some j.k. in their time and top. i now sense to peak each fund of the great care from a boat it contains one works on to the point the total number of could care for fixed term and ease on no fun of corruption on to them the. therefore the total number of glucose is down and bad animal of alignment. multiplied but a number of coast third time we she is in third on a final works on to them the. i heard implementation of the data structure we said just two options the first option ease the most efficient just start a set of curves.
14:54
nina hashed a bell use in cooking passion. they look at times than optimal. ohno md which is the size of the call. and we have a randomised construction. the second option is to start a good carers in a press extreme which he is a full deterministic social met at the cost of for good cocteau in the choir time. i now let's considered an army family.
15:27
kerry is the same approach will. because for to put it on our careers a in be a friend am the first set instance is minimize in the maximum distance of order. and did i make our opinions minimizing the sum of distances. more generally the mills and sellers to find their peak to distance focal which is the m.p. norm of the votes of those distances and then i'm. not as to when she ease in shame he will get the description of his hands and folky equals one would get them campaign.
16:12
i whipped less developed coach for the lp could the stance of the aisle from challenges here.
16:23
phelps twenty can't use the tram then in quite the which does not apply to their and picchu distance for fine and the.
16:33
the second china and easy to get rich we use has to be most at the m.g.m. mountain towns on them to go off one of the peak.
16:49
if we use our world where some humans we get our abound. so we have is a different continent meant that takes into account the sandwich distances and not their maximum. for some. if the distance between the first two points is already a lounge. the rest of the plans have chosen form much smaller bush. surprised me when ten almost the same stay strong for any finally be the only his ambition our class one here in the stalls based. some of the previous owners around so also applied to their normal family.
17:36
but then it will allow to coax him asian facto well with an exponential quality time. i'll of them has won last sept simple question facto and the n.l. on time. a.
17:54
but can also extend also sent to an ethnically case will the end of the quality can be smart well then the end of the in tears. this is set in general was first study in parallel by dramatic cells and me. we have that out that a structural for death metal kazan by computer simplifications of them k. for the workers and construct a set of grippers i with respect to the simplifications. we get sentimental bounce accept that and is replaced by cake. and now extension of this work is for their books on a plane county in problem when want to ten the number of input carroll's within the stands out from pew.
18:49
their books to mention here means they're this number might include addition an input cares that are within this times one perception on comes out for you. here the adaptation of our that the structure was easy because we just need to add accountable to each great care in the set i. the outer will count how many coasters. i.
19:20
so many questions left open world he is getting lower bounce for men is no problem. our conjecture is dead of space pound is almost up to my work on some facts on their own. the second quick question needs to find a much smaller they just start with any number of studies that at the cost of a constant approximation instead of one perception thank you for listening.
19:54
if.