'Open problems' presentation slideshows

Computational methods in phylogenetic analysis

1.28k views • 89 slides

On the Unique Games Conjecture

1.1k views • 86 slides

Kinetic Algorithms: Approximation and Trade-offs Pankaj K. Agarwal Duke University

Kinetic Algorithms: Approximation and Trade-offs Pankaj K. Agarwal Duke University. Motivation. Applications Location based services Animation Physical simulation Mobile and wireless networks Need algorithms and data structures for processing, analyzing, querying moving objects

541 views • 44 slides

Developing AI (Responsibly)

1.05k views • 40 slides

504 views • 40 slides

Adam Tauman Kalai, Georgia Tech. Yishay Mansour, Google and Tel-Aviv Elad Verbin, Tsinghua

On Agnostic Boosting and Parity Learning. Adam Tauman Kalai, Georgia Tech. Yishay Mansour, Google and Tel-Aviv Elad Verbin, Tsinghua. Defs. Agnostic Learning = learning with adversarial noise Boosting = turn weak learner into strong learner Parities = parities of subsets of the bits

812 views • 39 slides

A Pedagogical Conceptual Framework

481 views • 31 slides

O. M. Shalabiea Department of Physics, Northern Borders University, KSA

466 views • 30 slides

Delay-based Congestion Control

Delay-based Congestion Control. CCW 2003 David Wei http://netlab.caltech.edu. Topics. Summary of congestion control algorithms FAST Algorithm Experimental Results Open problems. Decision Function. Decision Function. Congestion Signal. Loss Delay ECN. Queueing delay. Vegas q=q*.

384 views • 24 slides

STCON in Directed Unique-Path Graphs

STCON in Directed Unique-Path Graphs. Sampath Kannan Sanjeev Khanna Sudeepa Roy University of Pennsylvania. (Directed) st-connectivity (STCON). t. t. s. directed path from s to t in G?. Questions involving STCON. Known Results NL-complete O(n) space and O(m+n) time (BFS or DFS)

498 views • 23 slides

Sorting Buffers on HSTs

314 views • 22 slides

The Data Stream Space Complexity of Cascaded Norms

The Data Stream Space Complexity of Cascaded Norms. T.S. Jayram David Woodruff IBM Almaden. Data streams. Algorithms access data in a sequential fashion One pass / small space Need to be randomized and approximate [FM, MP, AMS]. Algorithm. Main Memory.

273 views • 18 slides

QMA/qpoly ? PSPACE/poly: De-Merlinizing Quantum Protocols

316 views • 17 slides

Scott Aaronson (MIT)

299 views • 17 slides

Knot Tying with Single Piece Fixtures

Knot Tying with Single Piece Fixtures. Matthew Bell & Devin Balkcom Dartmouth College. Overview. Why are we tying knots? Why use fixtures? Knot fixture design Experimental and analytical observations Autonomous knot tying. Motivation. Why do we want to tie knots? Textile manufacturing

390 views • 16 slides

Planning Short Paths with Clearance using Explicit Corridors

Planning Short Paths with Clearance using Explicit Corridors. Roland Geraerts ICRA 2010. Requirements. Fast and flexible 2D path planner Real-time planning for thousands of characters Dealing with local hazards Global path Natural paths Smooth Short Keeps some distance to obstacles

261 views • 16 slides

747 views • 15 slides

278 views • 12 slides

NONLINEAR ADAPTIVE CONTROL

NONLINEAR ADAPTIVE CONTROL. RICCARDO MARINO UNIVERSITA DI ROMA TOR VERGATA. ADAPTIVE CONTROL OF LINEAR SYSTEMS ADAPTIVE CONTROL OF NONLINEAR SYSTEMS ADAPTIVE CONTROL OF TIME-VARYING SYSTEMS. ADAPTIVE DISTURBANCE ATTENUATION/ REJECTION ADAPTIVE REGULATION LEARNING CONTROL .

587 views • 10 slides

Nearest-Neighbor Classifiers

K nearest neighbor classification Presented by Vipin Kumar University of Minnesota kumar@cs.umn.edu Based on discussion in "Intro to Data Mining" by Tan, Steinbach, Kumar. Nearest-Neighbor Classifiers. Requires three things The set of stored records

752 views • 8 slides