<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>BestTechVideos: Tag conferences Videos</title>
    <link>http://www.bestechvideos.com/tag/conferences</link>
    <pubDate>Thu, 17 Apr 2008 19:10:04 GMT</pubDate>
    <description>BestTechVideos: Tag conferences Videos with short descriptions</description>
    <item>
      <title>How To Be Normal - A Guide For Developers</title>
      <link>http://www.bestechvideos.com/2008/04/17/how-to-be-normal-a-guide-for-developers</link>
      <description>&lt;div class="en_session_description description"&gt;
&lt;p&gt;At some point in every software project involving a database it becomes necessary for the developers who created (or inherited) the project to step back and take a look at their database. Many projects have a database schema that has evolved over time, with columns added here and tables added there, increasing complexity and often adding redundancy. Super-tables grow with more and more columns making ALTERs slow and backups difficult.&lt;/p&gt;
&lt;p&gt;In this session MySQL author and speaker Mike Hillyer will guide the audience through the principles of database normalization and review some common normalization scenarios encountered by many application developers.&lt;/p&gt;
&lt;p&gt;Topics include:&lt;/p&gt;
&lt;ul&gt;
    &lt;li&gt;What is normalization and what are its benefits?&lt;/li&gt;
    &lt;li&gt;What are the normal forms?
    &lt;ul&gt;
        &lt;li&gt;First Normal Form&lt;/li&gt;
        &lt;li&gt;Second Normal Form&lt;/li&gt;
        &lt;li&gt;Third Normal Form&lt;/li&gt;
        &lt;li&gt;And so on&amp;hellip;&lt;/li&gt;
    &lt;/ul&gt;
    &lt;/li&gt;
    &lt;li&gt;Normalization Scenarios&lt;/li&gt;
    &lt;li&gt;Relationships and Joins&lt;/li&gt;
    &lt;li&gt;How Much is Too Much?&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;This session is intended for a beginner to intermediate audience and is applicable to developers and administrators who deal with database design.&lt;/p&gt;
&lt;/div&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/04/17/how-to-be-normal-a-guide-for-developers"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/databases"&gt;Databases&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/development"&gt;Development&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/design"&gt;Design&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/databases/mysql"&gt;MySQL&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science/computer-science"&gt;Computer Science&lt;/a&gt;</description>
      <pubDate>Thu, 17 Apr 2008 19:10:04 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/04/17/how-to-be-normal-a-guide-for-developers</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>Scene Discovery by Matrix Factorization</title>
      <link>http://www.bestechvideos.com/2008/04/02/scene-discovery-by-matrix-factorization</link>
      <description>&lt;p&gt;Google Tech Talks&lt;br /&gt;
March, 24 2008&lt;br /&gt;
&lt;br /&gt;
ABSTRACT&lt;br /&gt;
&lt;br /&gt;
What constitutes a scene? Defining a meaningful vocabulary for scene discovery is a challenging problem that has important consequences for object recognition. We consider scenes to depict correlated objects and present visual similarity. We introduce a max-margin factorization model that finds a low dimensional subspace with high discriminative power for correlated annotations. We postulate this space should allow us to discover a large number of scenes in unsupervised data; we show scene discrimination results on par with supervised approaches. This model also produces state of the art word prediction results including good&lt;br /&gt;
annotation completion.&lt;br /&gt;
&lt;br /&gt;
Speaker: Ali Farhadi&lt;br /&gt;
Ali Farhadi is a PhD student in the UIUC Computer Science Department working on computer vision and machine learning under David Forsyth. His interests include image segmentation, transfer learning, scene understanding and human activity recognition.&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/04/02/scene-discovery-by-matrix-factorization"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies"&gt;Companies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting"&gt;Broadcasting&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science"&gt;Science&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies/google"&gt;Google&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science/math"&gt;Math&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science/computer-science"&gt;Computer Science&lt;/a&gt;</description>
      <pubDate>Mon, 07 Apr 2008 22:51:58 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/04/02/scene-discovery-by-matrix-factorization</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>Movie/Script: Alignment and Parsing of Video and Text Transcription</title>
      <link>http://www.bestechvideos.com/2008/04/02/movie-script-alignment-and-parsing-of-video-and-text-transcription</link>
      <description>&lt;p&gt;Google Tech Talks&lt;br /&gt;
March, 26 2008&lt;br /&gt;
&lt;br /&gt;
ABSTRACT&lt;br /&gt;
&lt;br /&gt;
Timothee Cour - Research Scientist &lt;br /&gt;
&lt;br /&gt;
Movies and TV are a rich source of highly diverse and complex video of people, objects, actions and locales &amp;quot;in the wild&amp;quot;. Harvesting automatically labeled sequences of actions from video would enable creation of large-scale and highly-varied datasets. To enable such collection, we focus on the task of recovering scene structure in movies and TV series for object/person tracking and action retrieval. We present a weakly supervised algorithm that uses the screenplay and closed captions to parse a movie into a hierarchy of shots and scenes. Scene boundaries in the movie are aligned with screenplay scene labels and shots are reordered into a sequence of long continuous tracks or threads which allow for more accurate tracking of people and actions across shot boundaries. Scene segmentation, alignment, and shot threading are formulated as inference in a unified generative model and a novel hierarchical dynamic programming algorithm that can handle alignment and jump-limited reorderings in linear time is introduced. We present quantitative and qualitative results on movie alignment and parsing, and use the recovered structure for tracking and naming of characters as well as retrieval of common actions in several episodes of popular TV series. &lt;br /&gt;
&lt;br /&gt;
If time permits we will also present our recent results on approximate inference with eigenvalue optimization.&lt;br /&gt;
&lt;br /&gt;
Speaker:  Timothee Cour - Research Scientist &lt;br /&gt;
Timothee Cour is a fifth year PhD student at the University of Pennsylvania, Philadelphia, in Computer Science. He completed his undergraduate education at the Ecole Polytechnique in France, majoring in Computer Science and Applied Mathematics. His research advisor is Prof. Ben Taskar and he also worked closely with Prof. Jianbo Shi.&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/04/02/movie-script-alignment-and-parsing-of-video-and-text-transcription"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies"&gt;Companies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science"&gt;Science&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies/google"&gt;Google&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science/dsp"&gt;DSP&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science/computer-science"&gt;Computer Science&lt;/a&gt;</description>
      <pubDate>Mon, 07 Apr 2008 22:51:25 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/04/02/movie-script-alignment-and-parsing-of-video-and-text-transcription</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>Optimization for Machine Learning</title>
      <link>http://www.bestechvideos.com/2008/04/02/optimization-for-machine-learning</link>
      <description>&lt;p&gt;Google Tech Talks&lt;br /&gt;
March, 25 2008&lt;br /&gt;
&lt;br /&gt;
ABSTRACT&lt;br /&gt;
&lt;br /&gt;
S.V.N. Vishwanathan - Research Scientist&lt;br /&gt;
&lt;br /&gt;
Regularized risk minimization is at the heart of many machine learning algorithms. The underlying objective function to be minimized is convex, and often non-smooth. Classical optimization algorithms cannot handle this efficiently. In this talk we present two algorithms for dealing with convex non-smooth objective functions. First, we extend the well known BFGS quasi-Newton algorithm to handle non-smooth&lt;br /&gt;
&lt;br /&gt;
functions. Second, we show how bundle methods can be applied in a machine learning context. We present both theoretical and experimental justification of our algorithms.&lt;br /&gt;
&lt;br /&gt;
Speaker: S.V.N. Vishwanathan - Research Scientist - Zurich&lt;br /&gt;
S.V.N Vishwanathan is a principal researcher in the Statistical Machine Learning program, National ICT Australia with an adjunct appointment at the College of Engineering and Computer Science(CECS), Australian National University. I got my Ph.D in 2002 from the Department of Computer Science and Automation (CSA) at the Indian Institute of Science.&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/04/02/optimization-for-machine-learning"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies"&gt;Companies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science"&gt;Science&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies/google"&gt;Google&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science/computer-science"&gt;Computer Science&lt;/a&gt;</description>
      <pubDate>Mon, 07 Apr 2008 22:50:57 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/04/02/optimization-for-machine-learning</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>Railscast: 5 View Tips</title>
      <link>http://www.bestechvideos.com/2008/04/07/railscast-5-view-tips</link>
      <description>&lt;p&gt;Here's five quick tips to use in views. Be sure to catch the end of the episode where I reveal an exciting contest!&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/04/07/railscast-5-view-tips"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/development"&gt;Development&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/frameworks"&gt;Frameworks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/development/ruby"&gt;Ruby&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/screencasts"&gt;Screencasts&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/frameworks/ruby-on-rails"&gt;Ruby On Rails&lt;/a&gt;</description>
      <pubDate>Mon, 07 Apr 2008 22:50:29 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/04/07/railscast-5-view-tips</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>JRuby: The power of Java and Ruby</title>
      <link>http://www.bestechvideos.com/2008/04/02/jruby-the-power-of-java-and-ruby</link>
      <description>&lt;p&gt;Google Tech Talks&lt;br /&gt;
February, 28 2008&lt;br /&gt;
&lt;br /&gt;
Speaker: Ola Bini&lt;br /&gt;
I work for ThoughtWorks Studios, and recently published the book Practical JRuby on Rails at APress. I'm very interested in Artificial Intelligence, Lisp, Ruby and the fuzzy lines between languages...&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/04/02/jruby-the-power-of-java-and-ruby"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies"&gt;Companies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/development"&gt;Development&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies/sun"&gt;Sun&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies/google"&gt;Google&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/development/java"&gt;Java&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/development/ruby"&gt;Ruby&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;</description>
      <pubDate>Wed, 02 Apr 2008 17:59:50 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/04/02/jruby-the-power-of-java-and-ruby</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>Algorithms for Data Management and Migration</title>
      <link>http://www.bestechvideos.com/2008/02/21/algorithms-for-data-management-and-migration</link>
      <description>&lt;p&gt;Google Tech Talks&lt;br /&gt;
January, 23 2008&lt;br /&gt;
&lt;br /&gt;
ABSTRACT&lt;br /&gt;
&lt;br /&gt;
I will describe some algorithms for addressing some fundamental optimization problems that arise in the context of data storage and management. In the first part of the talk we will address the following question: How should we store data in order to effectively cope with non-uniform demand for data? How many copies of popular data objects do we need? Where should we store them for effective load balancing?&lt;br /&gt;
&lt;br /&gt;
In the second part of the talk we will address the issue of moving data objects quickly, to react to changing demand patterns. We will develop approximation algorithms for these problems.&lt;/p&gt;
&lt;p&gt;The first part of the talk is joint work with Golubchik, Khanna,Thurimella and Zhu. The second part is joint work with Kim and Wan.&lt;br /&gt;
&lt;br /&gt;
Speaker: Samir Khuller&lt;br /&gt;
Samir Khuller received his M.S and Ph.D from Cornell University in 1989 and 1990, respectively. He spent 2 years as a Research Associate at the Institute for Advanced Computer Studies at the University of Maryland, before joining the Computer Science Department in 1992, where he is a Professor and Associate Chair in the Department of Computer Science.&lt;br /&gt;
&lt;br /&gt;
His research interests are in graph algorithms, discrete optimization, and computational geometry. He has published about 130 journal and conference papers, and several book chapters on these topics. He received the National Science Foundation's Career Development Award, the Dean's Teaching Excellence Award and also a CTE-Lilly Teaching Fellowship. In 2003, he and his students were awarded the &amp;quot;Best newcomer paper&amp;quot; award for the ACM PODS Conference. He received the University of Maryland's Distinguished Scholar Teacher Award in 2007.&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/02/21/algorithms-for-data-management-and-migration"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies"&gt;Companies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/development"&gt;Development&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science"&gt;Science&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies/google"&gt;Google&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/science/computer-science"&gt;Computer Science&lt;/a&gt;</description>
      <pubDate>Mon, 24 Mar 2008 16:11:11 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/02/21/algorithms-for-data-management-and-migration</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>KDE4 Release Event</title>
      <link>http://www.bestechvideos.com/2008/02/21/kde4-release-event-5</link>
      <description>&lt;p&gt;Google Tech Talks&lt;br /&gt;
January 18, 2008&lt;br /&gt;
&lt;br /&gt;
ABSTRACT&lt;br /&gt;
&lt;br /&gt;
Celebration of the KDE 4.0 release, a culmination of several years of design, development and testing.&lt;br /&gt;
&lt;br /&gt;
Speaker: Paul Adams&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/02/21/kde4-release-event-5"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/os"&gt;OS&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/os/linux"&gt;Linux&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/screencasts"&gt;Screencasts&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;</description>
      <pubDate>Sat, 22 Mar 2008 05:03:47 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/02/21/kde4-release-event-5</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>Content Delivery Network Pricing, Costs for Outsourced Video Delivery</title>
      <link>http://www.bestechvideos.com/2008/03/12/content-delivery-network-pricing-costs-for-outsourced-video-delivery</link>
      <description>&lt;p&gt;Whether you&amp;rsquo;re in an organization that needs to deliver lots of video or a smaller company that needs to deliver only a few videos, the going rate for these services can still be hard to figure out. What variables determine the final price? What is the going rate when you outsource delivery and storage to a third party?&lt;/p&gt;
&lt;p&gt;This presentation offers real pricing numbers from large, globally focused content delivery networks as well as smaller regional service providers. Hear what the going rate is today for video delivery and learn what you should really be paying for these services.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Presenter&lt;/strong&gt; Dan Rayburn, Executive Vice President, StreamingMedia.com&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/03/12/content-delivery-network-pricing-costs-for-outsourced-video-delivery"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/web-tech"&gt;Technologies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies"&gt;Companies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/networking"&gt;Networking&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/networking/ip"&gt;TCP/IP&lt;/a&gt;</description>
      <pubDate>Wed, 12 Mar 2008 23:35:59 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/03/12/content-delivery-network-pricing-costs-for-outsourced-video-delivery</guid>
      <author>scoundrel</author>
    </item>
    <item>
      <title>A Search Engine Architecture Based on Collection Selection</title>
      <link>http://www.bestechvideos.com/2008/01/30/a-search-engine-architecture-based-on-collection-selection</link>
      <description>&lt;p&gt;Google Tech Talks&lt;br /&gt;
December, 19 2007&lt;br /&gt;
&lt;br /&gt;
ABSTRACT&lt;br /&gt;
&lt;br /&gt;
We present a distributed architecture for a Web search engine, based on the concept of collection selection. We introduce a novel approach to partition the collection of documents, able to greatly improve the effectiveness of standard collection selection techniques (CORI), and a new selection function outperforming the state of the art. Our technique is based on the novel query-vector (QV) document model, built from the analysis of query logs, and on our strategy of co-clustering queries and documents at the same time. By suitably partitioning the documents in the collection, our system is able to select the subset of servers containing the most relevant documents for each query. Instead of broadcasting the query to every server in the computing platform, only the most relevant will be polled, this way reducing the average computing cost to solve a query. We introduce a novel strategy to use the instant load at each server to drive the query routing. Also, we describe a new approach to caching, able to incrementally improve the quality of the stored&lt;br /&gt;
results. Our caching strategy is effectively both in reducing computing load and in improving result quality. The proposed architecture, overall, presents a trade-off between computing cost and result quality, and we show how to guarantee very precise results in face of a dramatic reduction to computing load. This means that, with the same computing infrastructure, our system can serve more users, more queries and more documents.&lt;br /&gt;
&lt;br /&gt;
Speaker: Diego Puppin&lt;/p&gt;&lt;p&gt;&lt;a href="http://www.bestechvideos.com/2008/01/30/a-search-engine-architecture-based-on-collection-selection"&gt;Read more about this video&#8230;&lt;/a&gt;&lt;/p&gt;&lt;p&gt;&lt;b&gt;Want to control this feed contents?&lt;/b&gt;&amp;nbsp;&lt;a href="http://www.bestechvideos.com/user/all/signup"&gt;Sign up here&lt;/a&gt; and create your own feed!&lt;/p&gt;&lt;hr/&gt;Want more on these topics?&lt;br/&gt;Browse the archive of posts filed under &lt;a href="http://www.bestechvideos.com/category/conferences"&gt;Conferences&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies"&gt;Companies&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/conferences/techtalks"&gt;Techtalks&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/companies/google"&gt;Google&lt;/a&gt;, &lt;a href="http://www.bestechvideos.com/category/broadcasting/lectures"&gt;Lectures&lt;/a&gt;</description>
      <pubDate>Wed, 13 Feb 2008 19:49:56 GMT</pubDate>
      <guid>http://www.bestechvideos.com/2008/01/30/a-search-engine-architecture-based-on-collection-selection</guid>
      <author>scoundrel</author>
    </item>
  </channel>
</rss>
