Computer Systems Colloquium (Winter 2007)
http://deimos3.apple.com/WebObjects/Core.woa/Browse/itunes.stanford.edu-dz.4331554862.04331554864
Stanford UniversityComputer Systems Colloquium (Winter 2007)EngineeringStanfordENnoThe Computer Systems Laboratory Colloquium is the regular, weekly colloquium of the Computer Systems Laboratory. At each session, a guest lecturer examines some topic on current research and developments in computer systems. Speakers are drawn from industry, government, research, and educational institutions around the world.
The topics touch upon all aspects of computer science and engineering including logic design, computer organization and architecture, software engineering, computer applications of all sorts, public policy, and the social, business, and financial implications of technology. Frequently the Colloquium provides the first public forum for discussion of new products, discoveries, or ideas.falseComputer Architecture is Back: The Berkeley View of the Parallel Computing Research LandscapeNow that the IT industry is urgently facing perhaps its greatest challenge in 50 years, and computer architecture is a necessary but not sufficient component to any solution, this talk declares that computer architecture is interesting once again.Now that the IT industry is urgently facing perhaps its greatest challenge in 50 years, and computer architecture is a necessary but not sufficient component to any solution, this talk declares that computer architecture is interesting once again.4331554866Tue, 10 Apr 2007 11:41:48 GMTDave Patterson, UC Berkeley1:14:41Computer ScienceStanfordno1Building Your Own Dynamic Language is Fun and Easy! First Steps on the Road to Reinventing Computing (February 14, 2007)Viewpoints Research Insitute recently began a five-year project to reinvent programming and interaction with computers.Viewpoints Research Insitute recently began a five-year project to reinvent programming and interaction with computers.4331554872Tue, 10 Apr 2007 12:02:46 GMTIan Piumarta, Viewpoints Research Institute1:14:38Computer ScienceStanfordno2A New Balancing Method for Solving Parametric Maximum Flow Problems (March 14, 2007)A new, simple and fast algorithm finds a sequence of nested minimum cuts of a bipartite parametric flow network. The talk models how this new method can solve a number of interesting real-world problems.A new, simple and fast algorithm finds a sequence of nested minimum cuts of a bipartite parametric flow network. The talk models how this new method can solve a number of interesting real-world problems.4331554878Tue, 10 Apr 2007 16:45:30 GMTBin Zhang, HP Labs0:56:45Computer ScienceStanfordno3