[Solomonov Seminar] 151. Solomonov seminar

[Marko Grobelnik]

Vabim vas na 151. Solomonov seminar, ki bo v ponedeljek, 9. avgusta 2004 ob 
12:00 uri v sejni sobi E8 (oranzna predavalnica v drugem nadstropju glavne stavbe IJS).
Posnetki preteklih seminarjev so na http://solomon.ijs.si/

Na seminrju bo gost iz ZDA predstavil ucinkovito metodo za iskanje najblizjih sosedov.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
John Langford (http://hunch.net/~jl/), Toyota Technological Institute at Chicago

Fast, Exact Nearest Neighbor in Arbitrary Dimensions with a Cover Tree

Given only a metric between points, how quickly can the nearest neighbor of
a point be found?  In the worst case, this time is O(n).  When these points
happen to obey a dimensionality constraint, more speed is possible.

The "cover tree" is O(n) space datastructure which allows us to answer
queries in O(log(n)) time given a fixed intrinsic dimensionality.  It is
also a very practical algorithm yielding speedups between a factor of 1 and
1000 on all datasets tested.

This speedup has direct implications for several learning algorithms,
simulations, and some systems.