[Colloquium] Langford talk tomorrow 12:15 at TTI-C

[meridel]

TOYOTA TECHNOLOGICAL INSTITUTE TALK 

Speaker: John Langford

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

Time: Tuesday, September 28th, 12:15pm 
Place: TTI-C (1427 E. 60th St., 2nd Floor) 
LUNCH PROVIDED 

Speaker's Homepage: http://www.tti-c.org/langford.html
 
Abstract: 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 data structure 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 o f 1
and 1000 on all datasets tested.
 
This speedup has direct implications for several learning algorithms,
simulations, and some systems.
 
If you have questions, please contact Meridel at 4-9873 or
mtrimble at tti-c.org
 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20040927/267fc602/attachment.htm