<?xml version="1.0"?>
<oembed><version>1.0</version><provider_name>Department of Computer Science</provider_name><provider_url>https://www.cs.jhu.edu</provider_url><title>CS Seminar: Ke Li, UC Berkeley &#x2013; &#x201C;Nearest Neighbour Search and Generative Modelling&#x201D; - Department of Computer Science</title><type>rich</type><width>600</width><height>338</height><html>&lt;blockquote class="wp-embedded-content"&gt;&lt;a href="https://www.cs.jhu.edu/event/cs-seminar-ke-li-uc-berkeley-nearest-neighbour-search-and-generative-modelling/"&gt;CS Seminar: Ke Li, UC Berkeley &#x2013; &#x201C;Nearest Neighbour Search and Generative Modelling&#x201D;&lt;/a&gt;&lt;/blockquote&gt;
&lt;script type='text/javascript'&gt;
&lt;!--//--&gt;&lt;![CDATA[//&gt;&lt;!--
		/*! This file is auto-generated */
		!function(c,d){"use strict";var e=!1,n=!1;if(d.querySelector)if(c.addEventListener)e=!0;if(c.wp=c.wp||{},!c.wp.receiveEmbedMessage)if(c.wp.receiveEmbedMessage=function(e){var t=e.data;if(t)if(t.secret||t.message||t.value)if(!/[^a-zA-Z0-9]/.test(t.secret)){for(var r,a,i,s=d.querySelectorAll('iframe[data-secret="'+t.secret+'"]'),n=d.querySelectorAll('blockquote[data-secret="'+t.secret+'"]'),o=0;o&lt;n.length;o++)n[o].style.display="none";for(o=0;o&lt;s.length;o++)if(r=s[o],e.source===r.contentWindow){if(r.removeAttribute("style"),"height"===t.message){if(1e3&lt;(i=parseInt(t.value,10)))i=1e3;else if(~~i&lt;200)i=200;r.height=i}if("link"===t.message)if(a=d.createElement("a"),i=d.createElement("a"),a.href=r.getAttribute("src"),i.href=t.value,i.host===a.host)if(d.activeElement===r)c.top.location.href=t.value}}},e)c.addEventListener("message",c.wp.receiveEmbedMessage,!1),d.addEventListener("DOMContentLoaded",t,!1),c.addEventListener("load",t,!1);function t(){if(!n){n=!0;for(var e,t,r=-1!==navigator.appVersion.indexOf("MSIE 10"),a=!!navigator.userAgent.match(/Trident.*rv:11\./),i=d.querySelectorAll("iframe.wp-embedded-content"),s=0;s&lt;i.length;s++){if(!(e=i[s]).getAttribute("data-secret"))t=Math.random().toString(36).substr(2,10),e.src+="#?secret="+t,e.setAttribute("data-secret",t);if(r||a)(t=e.cloneNode(!0)).removeAttribute("security"),e.parentNode.replaceChild(t,e)}}}}(window,document);
//--&gt;&lt;!]]&gt;
&lt;/script&gt;&lt;iframe sandbox="allow-scripts" security="restricted" src="https://www.cs.jhu.edu/event/cs-seminar-ke-li-uc-berkeley-nearest-neighbour-search-and-generative-modelling/embed/" width="600" height="338" title="&#x201C;CS Seminar: Ke Li, UC Berkeley &#x2013; &#x201C;Nearest Neighbour Search and Generative Modelling&#x201D;&#x201D; &#x2014; Department of Computer Science" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" class="wp-embedded-content"&gt;&lt;/iframe&gt;</html><description>LocationHackerman Hall B-17AbstractMachine learning is subject to the limits of computation, and advances in algorithms can open up new possibilities for machine learning. The problem of nearest neighbour search arises commonly in machine learning; unfortunately, despite over 40 years of research, prior sublinear algorithms for exact nearest neighbour search suffer from the curse of dimensionality,&hellip;</description></oembed>
