Guestrin, Carlos - Center for Automated Learning and Discovery & School of Computer Science, Carnegie Mellon University

• Self-Adjusting Binary Search Trees DANIEL DOMINIC SLEATOR AND ROBERT ENDRE TARJAN
• A Decentralized Variable Ordering Method for Distributed Constraint
• Contract Type Sequencing for Reallocative Negotiation Martin Andersson and Tuomas Sandholm
• Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
• Envy Quotes and the Iterated Core-Selecting Combinatorial Auction Abraham Othman and Tuomas Sandholm
• Real-time Fault Detection and Situational Awareness for Rovers: Report on the Mars Technology Program Task
• Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions Craig Boutilier
• How many candidates are needed to make elections hard to manipulate?
• Beyond Local Appearance: Category Recognition from Pairwise Interactions of Simple Features
• Incremental Mechanism Design Vincent Conitzer
• Lossless Abstraction of Imperfect Information Games ANDREW GILPIN AND TUOMAS SANDHOLM
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Path Clearance Maxim Likhachev
• 354 IEEE TRANSACTIONS ON ROBOTICS, VOL. 21, NO. 3, JUNE 2005 Fast Replanning for Navigation in Unknown Terrain
• Search-based Planning for Manipulation with Motion Primitives Benjamin J. Cohen, Sachin Chitta, Maxim Likhachev,
• Time-bounded Lattice for Efficient Planning in Dynamic Environments Aleksandr Kushleyev
• Motion Planning in Urban Environments: Part II Dave Ferguson
• Goal Directed Navigation with Uncertainty in Adversary Locations Maxim Likhachev
• GS3 and Tartanian: Game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs
• Riffled Independence for Ranked Data Jonathan Huang, Carlos Guestrin
• Localizing Actions through Sequential 2D Video Projections Hakan Boyraz1
• Winner Determination in Combinatorial Auction Generalizations
• Hybrid Algorithms for OnLine Search and Combinatorial Optimization Problems.
• Multidimensional Triangulation and Interpolation for Reinforcement Learning
• An Efficient Technique for Calculating Exact NearestNeighbor Classification Accuracy
• Coalitions among Computationally Bounded Agents Tuomas W. Sandholm
• Underground coal mining is an industry well suited for robotic automation. Human operators are severely hampered in
• Excavators are used for the rapid removal of soil and other materials in mines, quarries, and construction sites.
• Approximating Optimal Combinatorial Auctions for Complements Using Restricted Welfare Maximization
• Learning Domain-Specific Planners From Example Plans
• Optimize-and-Dispatch Architecture for Expressive Ad David C. Parkes
• Speeding up the PartiGame Algorithm Maxim Likhachev
• 5 Distributed Rational Decision Making Tuomas W. Sandholm
• Lecture Notes for 36705, Fall 2006, Set 12
• 36705 Homework # 2 Solutions September 13, 2006
• F E A T U R E 1089 7801/97/$10.00 1997 IEEE h p : //compu t e r. o r g/ i n e r ne / NOVEMBER . DECEMBER 1997
• TimeQuality Tradeoffs in Reallocative Negotiation with Combinatorial Contract Types
• Vote Elicitation: Complexity and Strategy-Proofness
• To appear in Robotics & Automation Magazine, special issue on Human Centered Robotics and Dependability June 2004. Initial submission Aug 2002.
• MANAGEMENT SCIENCE Vol. 51, No. 3, March 2005, pp. 374390
• Data Association for Topic Intensity Tracking Andreas Krause krausea@cs.cmu.edu
• Planning for multiple mobile robots in dynamic environ-ments involves determining the optimal path each robot
• Maximum Likelihood Estimation of Dirichlet Distribution Jonathan Huang
• Reducing untruthful manipulation in envy-free Pareto optimal resource Roie Zivan, Miroslav Dudik, Steven Okamoto and Katia Sycara,
• PCA-SIFT: A More Distinctive Representation for Local Image Descriptors , Rahul Sukthankar2,1
• Lecture Notes for 36705, Fall 2006, Set 16
• Planning for multiple mobile robots in dynamic environ ments involves determining the optimal path each robot
• Hoe#ding/Cherno# proximately
• Journal of Machine Learning Research 9 (2008) 235-284 Submitted 9/06; Revised 9/07; Published 2/08 Near-Optimal Sensor Placements in Gaussian Processes
• Strategic Deliberation and Truthful Revelation: An Impossibility Result
• SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 1, pp. 160170
• Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information Sam Ganzfried
• 36705 Review Exam Solutions September 21, 2006
• Embedding Finite Metric Spaces into Normed Spaces
• 36705: Intermediate Statistics, Fall 2005 Review Exam
• Department of Statistics Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 annlee@stat.cmu.edu
• High-dimensional Planning on the GPU Mark Henderson, Joseph T. Kider Jr., Maxim Likhachev, and Alla Safonova
• This research is supported by DARPA/U.S. Army SMDC contract #DASG60-99-C-0081. Approved for Public Release; distribution unlimited.
• Efficient Planning of Informative Paths for Multiple Robots Amarjeet Singh
• DOI: 10.1007/s00453-002-1000-7 Algorithmica (2003) 35: 287300
• Automation of agricultural harvesting equipment in the near term appears both economically viable and techni-
• In Proceedings of SPIE AeroSense 2001. Robotic Technologies for Outdoor Industrial Vehicles
• EXPERIMENTAL INVESTIGATION OF TWT NONLINEARITIES AND DISTORTION SUPPRESSION BY SIGNAL INJECTION
• CONSTRAINED DYNAMIC ROUTE PLANNING FOR UNMANNED GROUND VEHICLES Anthony Stentz
• Expressive Banner Ad Auctions and Model-Based Online Optimization for Craig Boutilier
• Vote Elicitation: Complexity and Strategy-Proofness Vincent Conitzer and Tuomas Sandholm
• Advanced Approximation Algorithms CMU 15-854B, Spring 2008 How to Scribe
• CUP PRODUCTS IN COMPUTATIONAL TOPOLOGY JONATHAN HUANG
• Real-Time Motion Planning and Safe Navigation in Dynamic Multi-Robot
• On a bidirected relaxation for the Multiway Cut problem Chandra Chekuri Anupam Guptay Amit Kumarz
• DownloadedBy:[CarnegieMellonUniversity]At:21:252February2008 Network: Computation in Neural Systems
• Selecting Observations against Adversarial Objectives
• Object-Based Image Retrieval Using the Statistical Structure of Images Derek Hoiem
• Beyond Keyword Search: Discovering Relevant Scientific Literature
• A Constant Factor Approximation Algorithm for a Class of Classification Problems
• Experimental Verification of the Mechanisms for Nonlinear Harmonic Growth and Suppression by Harmonic Injection in a Traveling Wave Tube
• Learning Near-Pareto-Optimal Conventions in Polynomial Time
• Appears in: Proceedings of the International Symposium on Agent Systems and Applications, 1999 JGram: Rapid Development of Multi-Agent Pipelines
• A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
• Tree Embeddings for Two-Edge-Connected Network Design Anupam Gupta
• Meme-tracking and the Dynamics of the News Cycle Jure Leskovec
• CURRICULUM VIT personal data
• Efficient Privacy-Preserving Protocols for Multi-unit Auctions
• Artificial Intelligence 145 (2003) 3358 www.elsevier.com/locate/artint
• Adaptive Hausdorff Estimation of Density Level Sets Aarti Singh and Robert D. Nowak
• Unsupervised discovery of objects using temporal coherence Brandon C. S. Sanders1,2
• Submitted to the Annals of Statistics ADAPTIVE HAUSDORFF ESTIMATION OF DENSITY
• Bounded geometries, fractals, and low-distortion embeddings Anupam Gupta
• convergence probability
• On Learning Monotone Boolean Functions Avrim Blum \Lambda Carl Burch y John Langford z
• No-Commitment Branch and Bound Search for Distributed Constraint Optimization
• For a system of cooperative mobile robots to be effective in real-world applications, it must be able to efficiently execute
• Set Covering with Our Eyes Closed Fabrizio Grandoni Anupam Gupta Stefano Leonardi Pauli Miettinen
• Re intcdfromJOURNAL OP COMPUTERAND SmmmSCIENCES AIKights Reserved by Academic Press,New York and London Vol. 26, No. 3, June 1983
• NonParametric Fault Identification for Space Rovers Vandi Verma, John Langford, Reid Simmons
• 36705 Homework # 9 Solutions October 30, 2006
• Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
• 36705 Homework #7 Solutions October 2, 2006
• NEGOTIATION AMONG SELFINTERESTED COMPUTATIONALLY LIMITED AGENTS
• Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker
• Efficient Visual Event Detection using Volumetric Features , Rahul Sukthankar2,1
• Speeding up Moving-Target Search Sven Koenig
• A new randomized algorithm for Document Fingerprinting
• Clearly, it requires order n time to compute error(jd) from the d(i,j) alone. It is possible, however, to compute error(jd
• Computationally Limited Agents in Auctions Kate Larson
• Exploiting Probabilistic Independence for Permutations Jonathan Huang, Carlos Guestrin
• Efficient Inference for Distributions on Permutations Jonathan Huang
• Notes on the Kalman filter Geoff Gordon
• Function Approximation in Reinforcement Learning
• Simplifying rational functions Geoff Gordon
• An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
• Closing the Learning-Planning Loop with Predictive State Representations
• Closing the Learning-Planning Loop with Predictive State Representations
• Closing the Learning-Planning Loop with PSRs Byron Boots beb@cs.cmu.edu
• The Block Diagonal Infinite Hidden Markov Model Thomas Stepleton
• First-Order Mixed Integer Linear Programming Geoffrey J. Gordon
• Relational Learning via Collective Matrix Factorization Ajit P. Singh
• No-Regret Learning in Convex Games Geoffrey J. Gordon ggordon@cs.cmu.edu
• RADAR: A Personal Assistant that Learns to Reduce Email Overload Michael Freed1
• A Unification of Extensive-Form Games and Markov Decision Processes H. Brendan McMahan
• A Latent Space Approach to Dynamic Embedding of Co-occurrence Data
• Agendas for Multi-Agent Learning Geoffrey J. Gordon
• Adaptive Sampling for Multi-Robot Wide Area Prospecting
• No-regret Algorithms for Online Convex Programs Geoffrey J. Gordon
• Multi-Robot Negotiation: Approximating the Set of Subgame Perfect Equilibria in
• Robust Models of Object Geometry Jared Glover, Daniela Rus and Nicholas Roy
• The Support Vector Decomposition Machine Francisco Pereira1,3
• To appear in Intl. J. of Robotics Research April, 2006
• Decentralized Planning under Uncertainty for Teams of Communicating Agents
• Bounded Real-Time Dynamic Programming: RTDP with monotone upper bounds and performance guarantees
• Fast Exact Planning in Markov Decision Processes H. Brendan McMahan and Geoffrey J. Gordon
• Generalizing Dijkstra's Algorithm and Gaussian Elimination for Solving MDPs
• Anytime Dynamic A*: An Anytime, Replanning Algorithm Maxim Likhachev
• PARALLEL STOCHASTIC HILL-CLIMBING WITH SMALL TEAMS
• Planning for Markov Decision Processes with Sparse Stochasticity
• Approximate Solutions For Partially Observable Stochastic Games with Common Payoffs
• Better Motion Prediction for People-tracking Allison Bruce
• Planning in Cost-Paired Markov Decision Process Games
• Point-based value iteration: An anytime algorithm for POMDPs Joelle Pineau, Geoff Gordon and Sebastian Thrun
• Policy-contingent abstraction for robust robot control Joelle Pineau, Geoff Gordon and Sebastian Thrun
• Locating Moving Entities in Indoor Environments with Teams of Mobile Robots
• Appendix: Kernel Spectral Algorithm for HMM Le Song lesong@cs.cmu.edu
• A Constraint Generation Approach to Learning Stable Linear Dynamical Systems
• Learning Stable Multivariate Baseline Models for Outbreak Detection Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon, Artur W. Dubrawski
• Learning Tree Conditional Random Fields Joseph K. Bradley jkbradle@cs.cmu.edu
• FilterBoost: Regression and Classification on Large Joseph K. Bradley
• Efficient Principled Learning of Thin Junction Trees Anton Chechetka Carlos Guestrin
• Beyond Keyword Search: Discovering Relevant Scientific Khalid El-Arini
• Autonomous Visualization Khalid El-Arini Andrew W. Moore Ting Liu
• Bayesian Detection of Router Configuration Anomalies Khalid El-Arini
• Learning Hierarchical Rie Independent Groupings from Rankings Jonathan Huang jch1@cs.cmu.edu
• Learning Hierarchical Riffle Independent Groupings from Rankings
• Hilbert Space Embeddings of Conditional Distributions with Applications to Dynamical Systems
• Hilbert Space Embeddings of Conditional Distributions with Applications to Dynamical Systems Le Song Jonathan Huang Alex Smola Kenji Fukumizu
• Hilbert Space Embeddings of Conditional Distributions with Applications to Dynamical Systems
• n! n
• CORRELATED TOPIC MODEL DETAILS JONATHAN HUANG AND TOMASZ MALISIEWICZ
• 15-853 Project: Parallel Callahan-Kosaraju Algorithm for All-Nearest-Neighbors
• GraphLab: A New Framework For Parallel Machine Learning Yucheng Low
• Analyzing the effects of tags on promoting cooperation in Prisoner's Dilemma Austin McDonald and Sandip Sen
• Turning Down the Noise in the Blogosphere Khalid El-Arini
• Learning Partially Observable Action Schemas Dafna Shahaf and Eyal Amir
• Learning Thin Junction Trees via Graph Cuts Dafna Shahaf Anton Chechetka Carlos Guestrin
• Research Statement Maxim Likhachev
• Search-based Planning Motion Primitives
• J.M. VanBriesen Oct-10 1 Jeanne M. VanBriesen
• 86 communications of the acm | october 2008 | vol. 51 | no. 10 research highlights
• Int J Comput Vis (2008) 80: 315 DOI 10.1007/s11263-008-0137-5
• in Pittsburgh In vino veritas FotoRita
• Manuela M. Veloso Computer Science Department, Carnegie Mellon University, Pittsburgh PA 15213
• WiFi Localization and Navigation for Autonomous Indoor Mobile Robots
• LEARNING MOBILE ROBOT MOTION CONTROL FROM DEMONSTRATION AND CORRECTIVE
• Conditional Random Fields for Activity Recognition
• EXECUTION-TIME COMMUNICATION DECISIONS FOR COORDINATION OF
• On-line Robot Adaptation to Environmental Change
• Tree Based Hierarchical Reinforcement William T. B. Uther
• Automating the Modeling and Optimization of the Performance of Signal Processing Algorithms
• ICML/COLT 1997 LEARNING in PLANNING
• Planetary-Scale Views on a Large Instant-Messaging Network
• Rubinstein, A. 1998. Modeling Bounded Rationality. Cambridge, MA: MIT Press.
• Automated Mechanism Design: A New Application Area for Search Algorithms
• Self-interested Automated Mechanism Design and Implications for Optimal Combinatorial Auctions
• An Algorithm for Automatically Designing Deterministic Mechanisms without Vincent Conitzer and Tuomas Sandholm
• Applications of Automated Mechanism Design Vincent Conitzer
• Automated mechanism design with a structured outcome space Vincent Conitzer
• Approximating Revenue-Maximizing Combinatorial Auctions Anton Likhodedov and Tuomas Sandholm
• Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation
• Math. Program., Ser. A DOI 10.1007/s10107-010-0430-2
• Gradient-based Algorithms for Finding Nash Equilibria in Extensive Form Games
• Computing Equilibria by Incorporating Qualitative Models Sam Ganzfried
• A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation
• Optimal Rhode Island Hold'em Poker Andrew Gilpin and Tuomas Sandholm
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Computing the Optimal Strategy to Commit to Vincent Conitzer
• A Technique for Reducing Normal-Form Games to Compute a Nash Equilibrium
• Mixed-Integer Programming Methods for Finding Nash Equilibria Tuomas Sandholm and Andrew Gilpin and Vincent Conitzer
• Nonexistence of Voting Rules That Are Usually Hard to Manipulate Vincent Conitzer and Tuomas Sandholm
• Combinatorial Auctions with Externalities (Extended Abstract)
• Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions
• Expressive Negotiation over Donations to Charities Vincent Conitzer
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Chapter 14: Optimal Winner Determination Tuomas Sandholm
• Combinatorial Auctions with Structured Item Graphs Vincent Conitzer and Jonathan Derryberry and Tuomas Sandholm
• Failures of the VCG Mechanism in Combinatorial Auctions and Exchanges
• Arbitrage in Combinatorial Exchanges Andrew Gilpin and Tuomas Sandholm
• American Journal of Transplantation 2010; 10: 14601467 Wiley Periodicals Inc.
• Online Stochastic Optimization in the Large: Application to Kidney Exchange Pranjal Awasthi
• brief report The new engl and jour nal of medicine
• When Do Markets with Simple Agents Fail? Abraham Othman
• Online Algorithms for Market Clearing AVRIM BLUM AND TUOMAS SANDHOLM
• Preference Elicitation in Combinatorial Auctions [Extended Abstract]
• Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
• Effectiveness of preference elicitation in combinatorial Beno^it Hudson and Tuomas Sandholm
• Using Value Queries in Combinatorial Auctions Beno^it Hudson Tuomas Sandholm
• Journal of Machine Learning Research 5 (2004) 649-667 Submitted 1/04; Published 6/04 Preference Elicitation and Query Learning
• On Polynomial-Time Preference Elicitation with Value Martin A. Zinkevich
• Anonymous Pricing of Efficient Allocations in Combinatorial Economies Wolfram Conen
• Designing Auctions for Deliberative Agents Kate Larson and Tuomas Sandholm
• Experiments on deliberation equilibria in auctions Kate Larson and Tuomas Sandholm
• Miscomputing Ratio: Social Cost of Selfish Computing Kate Larson
• Miscomputing Ratio: The Social Cost of Selfish Computing Kate Larson and Tuomas Sandholm
• Costly Valuation Computation in Auctions Kate Larson and Tuomas Sandholm
• Issues in Computational Vickrey Auctions Tuomas Sandholm
• Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
• An Alternating Offers Bargaining Model for Computationally Limited Agents
• Time-Quality Tradeo s in Reallocative Negotiation with Combinatorial Contract Types
• Z .Games and Economic Behavior 35, 212 270 2001 doi:10.1006rgame.2000.0831, available online at http:rrwww.idealibrary.com on
• Artificial Intelligence 142 (2002) 239264 www.elsevier.com/locate/artint
• Leveled Commitment Contracts with Myopic and Strategic Agents
• Auctions with Untrustworthy Bidders Sviatoslav Braynov
• Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains
• Artificial Intelligence 111 (1999) 209238 Coalition structure generation with worst case
• Coalition Formation Processes with Belief Revision among Bounded-Rational
• Mach Learn (2007) 67:2343 DOI 10.1007/s10994-006-0143-1
• Communication complexity as a lower bound for learning in games Vincent Conitzer conitzer@cs.cmu.edu
• BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games Vincent Conitzer CONITZER@CS.CMU.EDU
• Using performance profile trees to improve deliberation control Kate Larson and Tuomas Sandholm
• Definition and Complexity of Some Basic Metareasoning Problems Vincent Conitzer and Tuomas Sandholm
• Terminating Decision Algorithms Optimally Tuomas Sandholm
• Monte Carlo Methods Geoff Gordon
• Support Vector Machines and Kernel Methods
• Building Planet-Scale Macroscopes using Multitudes of Sensors and Robots
• Think globally, act locally Geoff Gordon CMU Machine Learning
• In Proceedings of the International Joint Conference on Artificial intelligence (IJCAI) August 2003. 1 Variable Resolution Particle Filter
• Experiences with a Mobile Robotic Guide for the Elderly M. Montemerlo, J. Pineau, N. Roy, S. Thrun and V. Varma
• Unlabeled data: Now it helps, now it doesn't Aarti Singh, Robert D. Nowak
• ERRATA for NIPS 2008 paper "Unlabeled data: Now it helps, now it doesn't"
• Adaptive Hausdorff Estimation of Density Level Sets
• CONTROLLING THE ERROR IN FMRI: HYPOTHESIS TESTING OR SET ESTIMATION? Zachary Harmany and Rebecca Willett
• Decentralized Compression and Predistribution via Randomized Gossiping
• Injection schemes for TWT Linearization , J. G. Whlbier*
• AAddaappttiivvee ooiissee CCaanncceellllaattiioonn
• StudyofMDSMatrixusedinTwofishAES (AdvancedEncryptionStandard)Algorithm
• DEGAS: De Novo Discovery of Dysregulated Pathways in Human Diseases
• Recovering Euclidean Distance Matrices via Landmark MDS
• Rates of Convergence for Cross Validation Akshay Krishnamurthy
• Robust Probabilistic Filtering in Distributed Stanislav Funiak Carlos Guestrin Mark Paskin
• Distributed Localization of Networked Cameras Stanislav Funiak
• Combining Stochastic and Greedy Search in Hybrid Estimation Lars Blackmore
• Graphical Models and Overlay Networks for Reasoning about Large Distributed Systems
• 10-702: Statistical Machine Learning Syllabus, Spring 2010
• 15-859(B) Machine Learning $ %&'( )0(&112 '3%' !410'5
• Co-reference Resolution for Person Names Nguyen Bach & Simon Fung
• Practical Foundations for Programming Robert Harper
• Recognition by Association via Learning Per-exemplar Distances Tomasz Malisiewicz Alexei A. Efros
• Improving Spatial Support for Objects via Multiple Segmentations
• Registration of Multiple Range Scans as a Location Recognition Problem: Hypothesis Generation, Refinement and Verification
• FITTING A HIERARCHICAL LOGISTIC NORMAL DISTRIBUTION
• Personal Information Systems Gaurav Veda, Sarvesh Dwivedi
• Trusted Computing & Pseudonymity : An Introduction and Survey
• Maximum Entropy Distribution Estimation with Generalized Regularization
• A Maximum Entropy Approach to Species Distribution Modeling Steven J. Phillips PHILLIPS@RESEARCH.ATT.COM
• MAXIMUM ENTROPY DENSITY ESTIMATION AND MODELING
• Optimizing Sensing Theory and Applications
• Efficiently Computing Minimax Expected-Size Confidence Regions Brent Bryan bryanba@cs.cmu.edu
• Online convex optimization in the bandit setting: gradient descent without a gradient
• Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles
• Probabilistic Planning with Clear Preferences on Missing Information
• Anytime Search in Dynamic Graphs Maxim Likhachev a
• Lifelong Planning A* Sven Koenig a
• SIPP: Safe Interval Path Planning for Dynamic Environments Mike Phillips and Maxim Likhachev
• Cart Pushing with a Mobile Manipulation System: Towards Navigation with Moveable Objects
• Search-based Path Planning with Homotopy Class Constraints Subhrajit Bhattacharya
• High-dimensional Planning on the GPU Joseph T. Kider Jr., Mark Henderson, Maxim Likhachev, and Alla Safonova
• Motion Planning in Urban Environments: Part I Dave Ferguson
• Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles
• Information Value-Driven Approach to Path Clearance with Multiple Scout Robots
• PPCP: Efficient Probabilistic Planning with Clear Preferences in Partially-Known Environments
• Bounded Real-Time Dynamic Programming: RTDP with monotone upper bounds and performance guarantees
• A Generalized Framework for Lifelong Planning A* Search Maxim Likhachev
• This paper presents an approach to learning an optimal behavioral parameterization in the framework of a Case-Based
• A Guide to Heuristic-based Path Planning Dave Ferguson, Maxim Likhachev, and Anthony Stentz
• Incremental Heuristic Search in Games: The Quest for Speed Maxim Likhachev
• A New Principle for Incremental Heuristic Search: Theoretical Results Sven Koenig
• Adaptive A* Sven Koenig
• A Free Market Architecture for Coordinating Multiple Robots
• In Proceedings AAAI 96 Spring Symposium on Planning with Incomplete Information for Robot Problems. Map-Based Strategies for Robot Navigation in Unknown Environments
• Copyright 2002, American Association for Artificial Intelligence (www.aaai.org). All rights reserved.
• The Crusher System for Autonomous Navigation Anthony Stentz, John Bares, Thomas Pilarski, and David Stager
• Excavators are used for the rapid removal of soil and other materials in mines, quarries, and construction sites.
• Distributed Pattern Discovery in Multiple Spiros Papadimitriou
• User's Guide 1. Overview .......................................................................................................................3
• Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and
• Forest Density Estimation Anupam Gupta
• Nonclairvoyantly Scheduling Power-Heterogeneous Processors Anupam Gupta Ravishankar Krishnaswamy
• Scalably Scheduling Power-Heterogeneous Anupam Gupta1
• Online and Stochastic Survivable Network Design Anupam Gupta
• Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp -
• A Plant Location Guide for the Unsure Barbara M. Anthony
• MATHEMATICS OF OPERATIONS RESEARCH Vol. 35, No. 1, February 2010, pp. 79101
• Approximating TSP on Metrics with Bounded Global Growth T-H. Hubert Chan Anupam Gupta
• Stochastic Analyses for Online Combinatorial Optimization Problems
• k)-competitive Algorithm for Metric Bipartite Matching
• Spanners with Slack T.-H. Hubert Chan , Michael Dinitz , and Anupam Gupta
• Oblivious Network Design Anupam Gupta
• Approximating Unique Games Anupam Gupta Kunal Talwar
• Quorum Placement in Networks to Minimize Access Delays Anupam Gupta
• What about Wednesday? Approximation Algorithms for Multistage Stochastic
• Where's the Winner? Max-Finding and Sorting with Metric Costs
• On the Approximability of Some Network Design Problems Julia Chuzhoy
• log log n) Integrality Gap for Priority Steiner J. Chuzhoy, A. Gupta, J. (S.) Naor, A. Sinha
• An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design
• Simpler and Better Approximation Algorithms for Network Anupam Gupta Amit Kumar Tim Roughgarden
• Counting Inversions in Lists Anupam Gupta Francis X. Zane
• Provisioning a Virtual Private Network: A Network Design Problem for Multicommodity Flow
• Distributed Algorithms for Approximating Wireless Network Capacity
• Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and
• Graphical representations of clutters Michael H. Dinitz, Jonah M. Gold, Thomas C. Sharkey and Lorenzo Traldi
• Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
• An optimal SDP algorithm for Max-Cut, and equally optimal Long Code tests
• Advanced Approximation Algorithms CMU 15-854B, Spring 2008 Algorithmic Problem Definitions
• 15-251: Great Theoretical Ideas in Computer Science Anupam Gupta Common Mistakes in Induction Proofs (draft!!) January 28, 2011
• 15-251: Great Theoretical Ideas in Computer Science Anupam Gupta Notes on Polynomials, Interpolation, and Codes (draft!!) January 28, 2011
• Robust Probabilistic Inference in Distributed Systems Mark A. Paskin
• Distributed Inference in Dynamical Systems Stanislav Funiak Carlos Guestrin
• A Robust Architecture for Distributed Inference in Sensor Networks
• Violence Detection in Video Using Computer Vision Techniques
• Fast Motion Consistency through Matrix Quantization
• DISTRIBUTED ONLINE ANOMALY DETECTION IN HIGH-CONTENT SCREENING , Rahul Sukthankar
• Space-Time Shapelets for Action Recognition Dhruv Batra1
• Event Detection in Crowded Videos , Rahul Sukthankar2,1
• Distributed Inference in Dynamical Systems Stanislav Funiak Carlos Guestrin
• Semantic Learning for Audio Applications: A Computer Vision Approach Rahul Sukthankar1,2
• Efficient Visual Event Detection using Volumetric Features , Rahul Sukthankar2,1
• Computer Vision for Music Identification , Derek Hoiem1
• Dynamic Load Balancing for Distributed Search L. Huston1 A. Nizhner2 P. Pillai1 R. Sukthankar1,2 P. Steenkiste2 J. Zhang3
• A Robust Visual Odometry and Precipice Detection System Using Consumer-grade Monocular Vision
• Correcting Luminance for Obliquely-Projected Displays Robert ULICHNEY1
• Forensic Video Reconstruction Larry Huston
• Robust Projected Displays for Ubiquitous Computing Jay W. Summet, Matthew Flagg, Mark Ashdown, Rahul Sukthankar, James M.
• Shadow Elimination and Occluder Light Suppression for Multi-Projector Displays
• Complete Cross-Validation for Nearest Neighbor Classifiers Matthew Mullin MDM@JUSTRESEARCH.COM
• Pacific Association for Computational Linguistics APPLYING MACHINE LEARNING FOR HIGH
• Appears in: Proceedings of Intelligent Systems and Advanced Manufacturing, 1997 A distributed tactical reasoning framework
• Discovering Objects Using Temporal Information Brandon C. S. Sanders
• Spatio-temporal Shape and Flow Correlation for Action Recognition , Rahul Sukthankar2,1
• Efficient Temporal Mean Shift for Activity Recognition in VideoEfficient Temporal Mean Shift for Activity Recognition in Video Yan Ke1, Rahul Sukthankar2,1, Martial Hebert1
• Beyond Trees: MRF Inference via Outer-Planar Decomposition Dhruv Batra
• PCA-SIFT: A More Distinctive Representation for Local Image Descriptors , Rahul Sukthankar2,1
• Computer Vision for Music Identification , Derek Hoiem1
• Tutorial for GraphLab Python API: Lasso Shooting Algorithm
• NearOptimal Bayesian Active Learning with Noisy Observations
• Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
• Inferring Networks of Diffusion and Influence Gomez-Rodriguez
• Online Distributed Sensor Selection Daniel Golovin
• Robust Submodular Observation Selection Andreas Krause
• Selecting Observations against Adversarial Objectives Andreas Krause
• Nonmyopic Active Learning of Gaussian Processes
• Data Association for Topic Intensity Tracking Andreas Krause Jure Leskovec Carlos Guestrin
• SenSay: A Context-Aware Mobile Phone Daniel Siewiorek, Asim Smailagic, Junichi Furukawa, Andreas Krause, Neema Moraveji,
• Accurate method for fast design of diagnostic oligonucleotide probe sets for DNA microarrays
• B 7 E 7 E 7F7F7B 7E 7E 7 Note Sequence
• Autonomous planetary rovers operating in vast unknown environments must operate efficiently because of size,
• Multi-Manifold Semi-Supervised Learning Computer Sciences Dept.
• Abstract---The coordination of a large group of robots to solve a specified task is a difficult problem. Centralized approaches can be computationally intractable, brittle, and unresponsive to change.
• In Proceedings IEEE International Conference on Robotics and Automation, May 1994. Optimal and Efficient Path Planning for PartiallyKnown Environments
• In Proceedings of the International Joint Conference on Artificial Intelligence, August 1995. The Focussed D* Algorithm for RealTime Replanning
• Compact Routing with Slack Michael Dinitz #
• Approximating the SingleSink Link Installation Problem in Network Design \Lambda F. S. Salman y J. Cheriyan z R. Ravi x S. Subramanian --
• 36705 Homework # 4 Solutions September 19, 2006
• Automated Online Mechanism Design and Prophet Inequalities MohammadTaghi Hajiaghayi
• Optimal Rhode Island Hold'em Poker Andrew Gilpin and Tuomas Sandholm
• A heads-up no-limit Texas Hold'em poker player: Discretized betting models and automatically generated
• Partial-revelation VCG mechanism for combinatorial auctions Wolfram Conen
• Boosted Sampling: Approximation Algorithms for Stochastic Optimization
• Parallel Coordinate Descent for L1-Regularized Loss Minimization Joseph K. Bradley jkbradle@cs.cmu.edu
• Search-based Planning for Large Dynamic Environments
• J. Expt. Theor. Artif. Intell. 12(2000)2342 Anytim e coalition structure generation: an average case study
• Asymmetric Spite in Auctions Ankit Sharma and Tuomas Sandholm
• Toward Never Ending Language Learning Justin Betteridge1
• The Economist Technology Quarterly December 2nd 2006 Monitor 3 These structures can bend and twist, but
• Mobile robots operating in vast outdoor unstructured environments often only have incomplete maps and must
• Autonomous Visualization Khalid El-Arini, Andrew W. Moore, and Ting Liu
• Terminating Decision Algorithms Optimally Tuomas Sandholm
• Logical Circuit Filtering Dafna Shahaf and Eyal Amir
• Recovering Occlusion Boundaries from a Single Image Derek Hoiem
• JKanji: Waveletbased Interactive Kanji Completion Robert Stockton 1
• Applying MetricTrees to BeliefPoint POMDPs Joelle Pineau, Geoffrey Gordon
• Workshop on Discrete Metric Spaces and their Algorithmic Applications
• Header for SPIE use Robotic Comfort Zones
• A Free Market Architecture for Coordinating Multiple Robots
• Approximate Solutions to Markov Decision Processes
• Thesis Proposal Probabilistic Reasoning with Permutations
• Reduced-Rank Hidden Markov Models Sajid M. Siddiqi
• Improved Results for Directed Multicut Anupam Gupta
• Thresholded-Rewards Decision Problems: Acting Effectively in Timed
• Stochastic Steiner Trees without a Root Anupam Gupta1
• High-Dimensional Clustering with Sparse Mixtures of Akshay Krishnamurthy
• Generated by Doxygen 1.6.1 Sun Apr 11 07:00:44 2010
• No-Regret Learning and a Mechanism for Distributed Multiagent Planning
• An Any-space Algorithm for Distributed Constraint Optimization Anton Chechetka and Katia Sycara
• Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
• Distributed Planning in Hierarchical Factored MDPs Carlos Guestrin
• In Proceedings AAAI 96 Spring Symposium on Planning with Incomplete Information for Robot Problems. MapBased Strategies for Robot Navigation in Unknown Environments
• Linear Programming, Lagrange Multipliers,
• Games and Economic Behavior 55 (2006) 321330 www.elsevier.com/locate/geb
• Second-and Third-order Signal Predistortion for Nonlinear Distortion Suppression in a Traveling
• Lecture Notes for 36705, drawn from Wasserman's text. Fall 2006, Set 15
• Layered Learning in MultiAgent Peter Stone
• is not the case with, for example, a neural net representa tion. The large number of free parameters allows the histo
• GraphLab: A New Framework For Parallel Machine Learning Yucheng Low
• Residual Splash for Optimally Parallelizing Belief Propagation Joseph E. Gonzalez
• Automated Mechanism Design: Complexity Results Stemming from the Single-Agent
• In Autonomous Robots, Volume 2, Number 2, August 1995 A Complete Navigation System for Goal Acquisition in Unknown Environments
• Computational Criticisms of the Revelation Principle Vincent Conitzer
• Constructing and Clearing Combinatorial Exchanges Using Preference Elicitation 14 March 2002
• A Reasoning Framework for Autonomous Urban Driving Dave Ferguson, Christopher Baker, Maxim Likhachev, and John Dolan
• Lecture Notes for 36705, Fall 2006, Set 17
• Reinforcement Learning to Play An Optimal Nash Equilibrium in Team Markov Games
• A polylogarithmic approximation algorithm for the group Steiner tree Naveen Garg Goran Konjevod y R. Ravi z
• Clearly, it requires order n time to compute error(j d ) from the d(i,j) alone. It is possible, however, to compute error(j d
• Metric Embeddings with Relaxed Guarantees Ittai Abraham
• october 2008 | vol. 51 | no. 10 | communications of the acm 87 Doi:10.1145/1400181.1400202
• A Bayesian Matrix Factorization Model for Relational Data Ajit P. Singh
• Incremental Phi*: Incremental Any-Angle Path Planning on Grids Alex Nash and Sven Koenig
• Ecient Inference with Partial Ranking Queries: Supplementary Material
• Secretary Problems: Weights and Discounts Moshe Babaioff
• Speeding Up Gradient-Based Algorithms for Sequential (Extended Abstract)
• Appears in: Proceedings of AI, Simulation and Planning in High Autonomy Systems, 1996 A Simulation and Design System for Tactical Driving Algorithms
• Efficient Temporal Mean Shift for Activity Recognition in Video , Rahul Sukthankar2,1
• The Cost of Inexpressiveness in Advertisement Auctions Michael Benisch
• Active Learning for Information Extraction via Bootstrapping Andrew Carlson, Sue Ann Hong, Kevin Killourhy, Sophie Wang
• Peer to peer systems: An overview Gaurav Veda (Y1148)
• Memorybased Face Recognition for Visitor Identification Terence Sim 1 Rahul Sukthankar 1;2 Matthew Mullin 2 Shumeet Baluja 1;2
• 36705: Intermediate Statistics, Fall 2006 http://www.stat.cmu.edu/#roeder/stat705
• in Advances in Neural Information Processing Systems 15 S. Becker, S. Thrun and K. Obermayer (eds.),
• Algorithms for Optimizing Leveled Commitment Contracts \Lambda Tuomas Sandholm, Sandeep Sikka, and Samphel Norden
• Appearing in Advances in Neural information Processing Systems 21, 2009 Generative and Discriminative Learning with
• Reinforcement Learning with Function Approximation Converges to a Region
• Algorithm Evolution with Internal Reinforcement
• Riffled Independence for Ranked Data Jonathan Huang, Carlos Guestrin
• Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces
• Applications of Automated Mechanism Design Vincent Conitzer and Tuomas Sandholm
• Detecting Weak but Hierarchically-Structured Patterns in Networks Aarti Singh Robert Nowak Robert Calderbank
• A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
• Generalizing Preference Elicitation in Combinatorial Beno^it Hudson
• Automated Market-Making in the Large: The Gates Hillman Prediction Market
• Discriminative Clustering by Regularized Information Maximization
• Learning Hierarchical Rie Independent Groupings from Rankings: Supplemental Material
• Turning Down the Noise in the Blogosphere Khalid El-Arini
• Efficient Principled Learning of Thin Junction Trees Anton Chechetka Carlos Guestrin
• Multi-agent Path Planning with Multiple Tasks and Distance Constraints
• Approximate Kalman Filters for Embedding Author-Word Co-occurrence Data over Time
• Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
• 36705 Homework # 12 Solutions November 20, 2006
• 36705: Intermediate Statistics, Fall 2004 Review Exam
• 36705 Homework #3 Solutions September 19, 2006
• Exploiting MetaLevel Information in a Distributed Scheduling System \Lambda
• 36705 Homework # 8 Solutions October 11, 2006
• 36705 Homework # 6 Solutions October 6, 2006
• ON THE SPERNER LEMMA AND ITS APPLICATIONS JONATHAN HUANG
• In Proceedings of the International Joint Conference on Artificial Intelligence, August 1995. The Focussed D* Algorithm for Real-Time Replanning
• Dirichlet Processes A gentle tutorial
• Forschungsinstitut fr Mathematik, ETH Zrich "Topology and Robotics, 2006"
• Unifying Discriminative Visual Codebook Generation with Classifier Training for Object Category Recognition
• Cost-Sharing Mechanisms for Network Design Anupam Gupta
• Dynamic Shadow Elimination for Multi-Projector Displays Rahul Sukthankar Tat-Jen Cham Gita Sukthankar
• Multi-Robot Exploration Controlled by a Market Economy Robert Zlot, Anthony (Tony) Stentz, M. Bernardine Dias, Scott Thayer
• OnLine Algorithms in Machine Learning Carnegie Mellon University, Pittsburgh PA 15213. Email: avrim@cs.cmu.edu
• Black Box and Generalized Algorithms for Planning in Uncertain Domains
• Computational Criticisms of the Revelation Principle Vincent Conitzer Tuomas Sandholm
• in Advances in Neural Information Processing Systems 15 S. Becker, S. Thrun and K. Obermayer (eds.),
• is not the case with, for example, a neural net representa-tion. The large number of free parameters allows the histo-
• Maxim Likhachev Computer and Information Science
• Trajectons: Action Recognition Through the Motion Analysis of Tracked Features
• Chattering in SARSA() A CMU Learning Lab Internal Report
• Cherno#/Hoe#ding Convergence
• SituationDependent Learning for Interleaved Planning and Robot Execution
• Using value queries in combinatorial auctions Beno^ t Hudson ? and Tuomas Sandholm
• In Autonomous Robots, Volume 2, Number 2, August 1995 A Complete Navigation System for Goal Acquisition in Unknown Environments
• Complete CrossValidation for Nearest Neighbor Classifiers Matthew Mullin MDM@JUSTRESEARCH.COM
• Real-Time, Multi-Perspective Perception for Unmanned Ground Vehicles Anthony Stentz, Alonzo Kelly, Peter Rander, Herman Herman, Omead Amidi
• Generalized Task Markets for Human and Machine Computation Dafna Shahaf
• Solving two-person zero-sum repeated games of incomplete information
• Bargaining with Deadlines Tuomas Sandholm
• Distributed Optimization with Pairwise Constraints and its Application to Multi-robot Path Planning
• Expressiveness in mechanisms and its relation to efficiency
• Planning for Autonomous Door Opening with a Mobile Manipulator Sachin Chitta, Benjamin Cohen, Maxim Likhachev,
• Multi-Robot Negotiation: Approximating the Set of Subgame Perfect Equilibria in
• Unfreezing the Robot: Navigation in Dense, Interacting Crowds Peter Trautman and Andreas Krause
• A NOVEL APPROXIMATE INFERENCE APPROACH TO AUTOMATED CLASSIFICATION OF PROTEIN SUBCELLULAR LOCATION PATTERNS IN MULTI-CELL IMAGES
• High-Dimensional Clustering with Sparse Gaussian Mixture Models
• Hilbert Space Embeddings of Hidden Markov Models Le Song lesong@cs.cmu.edu
• Generalizing Preference Elicitation in Combinatorial Auctions Content Areas: multiagent systems, negotiation
• A.2 Label-Cover Hardness for Stochastic Steiner Tree with Correlated Costs Recall that our results hold only when the edge costs on Tuesday are independent of the set of
• A More Distinctive Representation for Local Image Descriptors
• Submodular Dictionary Selection for Sparse Representation Andreas Krause krausea@caltech.edu
• Search-based Planning for a Legged Robot over Rough Terrain Paul Vernaza, Maxim Likhachev, Subhrajit Bhattacharya, Sachin Chitta, Aleksandr Kushleyev, Daniel D. Lee
• Learning Class-Specific Affinities for Image Labelling Dhruv Batra1
• Near-Optimal Sensor Placements in Gaussian Processes Carlos Guestrin GUESTRIN@CS.CMU.EDU
• Strategy Purification (Extended Abstract)
• Optimal Clearing of Supply/Demand Curves Tuomas Sandholm
• Closed-Form Supervised Dimensionality Reduction with Generalized Linear Models
• Distributed Parallel Inference on Large Factor Graphs Joseph E. Gonzalez
• Leveled Commitment Contracting among Myopic Individually Rational Agents
• Artificial Intelligence 132 (2001) 183217 Bargaining with limited computation
• Optimal Nonmyopic Value of Information in Graphical Models Efficient Algorithms and Theoretical Limits
• Simultaneous Placement and Scheduling of Sensors
• Repnntedfrom JOURNALOF COMPUTERAND Svssasc SCIENCTS All hgbts Rescrvcd by Academic Prcss, New York and London
• Applying ModelBased Search to Reinforcement Learning Scott Davies Andrew Y. Ng Andrew Moore
• TOPICS IN QUADRATIC FORMS OVER FINITE FIELDS H. B. MCMAHAN
• RankBased Tests Geoff Gordon
• Situation Awareness for Tactical Driving Rahul Sukthankar
• Applying Online Search Techniques to Reinforcement Learning
• variational Rangarajan.
• Risk Sensitive Particle Filters Sebastian Thrun, John Langford, Vandi Verma
• Journal of Artificial Intelligence Research 4 (1996) 237285 Submitted 9/95; published 5/96 Reinforcement Learning: A Survey
• Experiences with a Mobile Robotic Guide for the Elderly M. Montemerlo, J. Pineau, N. Roy, S. Thrun and V. Varma
• The geometry of graphs and some of its algorithmic applications \Lambda Nathan Linial y Eran London Yuri Rabinovich
• C H A P T E R CUT PROBLEMS AND THEIR
• GAUSS-MARKOV MODELS JONATHAN HUANG
• Learning Stable Linear Dynamical Systems Learning Stable Linear Dynamical Systems
• Applications for Multi-Planar Projected Displays Mark Ashdown1
• Maximizing revenue in symmetric resource allocation systems when user utilities exhibit diminishing returns
• Distributed Localization of Networked Cameras Stanislav Funiak
• Efficient Minimization of Decomposable Submodular Functions
• Lecture Notes for 36705, Fall 2006, Set 13
• Decentralized Sensor Fusion with Distributed Particle Filters Matt Rosencrantz, Geoffrey Gordon, and Sebastian Thrun
• Distributed Value Functions Jeff Schneider
• Safe Exchange Planner Tuomas Sandholm and Vincent Ferrandon
• Lecture Notes for 36705 Intermediate Statistics
• Lecture Notes for 36705, Fall 2006, Set 11
• Planning under Uncertainty for Reliable Health Care Nicholas Roy 1 , Geoffrey Gordon 2 , and Sebastian Thrun 3
• Simultaneous Placement and Scheduling of Sensors Andreas Krause
• Market Clearability Tuomas Sandholm
• Vol. 36, No. 1, JanuaryFebruary 2006, pp. 5568 issn 0092-2102 eissn 1526-551X 06 3601 0055
• of bending and straightening makes the tank-tread configuration roll (see figure below).
• Complexity of Mechanism Design Vincent Conitzer and Tuomas Sandholm
• Unsupervised, Dynamic Identification of Physiological and Activity Context in Wearable Computing
• Bayesian Detection of Router Configuration Anomalies Khalid El-Arini
• Decision Theoretic Execution Strategies for Modularized Problem Solvers Kris Hauser Jean-Claude Latombe
• Steiner points in tree metrics don't (really) help Anupam Gupta
• DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently
• Efficient Cost Computation in Cost Map Planning for Non-Circular Jennifer King
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Side Constraints and Non-Price Attributes in Markets Tuomas Sandholm
• Riffled Independence for Ranked Data (extended version with proofs)
• Abstract--The coordination of a large group of robots to solve a specified task is a difficult problem. Centralized approaches can be computationally intractable, brittle, and unresponsive to change.
• Journal of Machine Learning Research 9 (2008) 2761-2801 Submitted 1/08; Revised 9/08; Published 12/08 Robust Submodular Observation Selection
• Methods for boosting revenue in combinatorial auctions Anton Likhodedov and Tuomas Sandholm
• E cient Inference for Distributions on Permutations Jonathan Huang Carlos Guestrin Leonidas Guibas
• Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
• In Proceedings of the International Joint Conference on Artificial intelligence (IJCAI) August 2003. 1 Variable Resolution Particle Filter
• 15859(B) Machine Learning Theory Probabilistic inequalities
• Mobile robots operating in vast outdoor unstructured environments often only have incomplete maps and must
• International Symposium on Artificial Intelligence and Robotics in Space (iSAIRAS), May, 2003 Efficient Monitoring for Planetary Rovers
• Sven Koenig College of Computing
• Approximation Reinforcement
• FOCS 2005 Program The 46th Annual IEEE Symposium on
• Maria-Florina Balcan Modern Topics in Learning Theory
• An Effective Personal Mobile Robot Agent Through Symbiotic Human-Robot Interaction
• Near-optimal Observation Selection using Submodular Functions Andreas Krause
• Microscopic Evolution of Social Networks Jure Leskovec
• Active Learning for Adaptive Mobile Sensing Networks Aarti Singh, Robert Nowak and Parmesh Ramanathan
• SOLAR: Sound Object Localization and Retrieval in Complex Audio Environments Derek Hoiem1
• Intermodulation Suppression in a Broad Band TWT* A. Singh, J. Scharer, M. Wirth, S. Bhatacharjee and J. Booske
• First-Order Mixed Integer Linear Programming Geoffrey J. Gordon
• Ecological Applications, 19(1), 2009, pp. 181197 2009 by the Ecological Society of America
• Efficient Planning of Informative Paths for Multiple Robots
• SOLAR: Sound Object Localization and Retrieval in Complex Audio Environments Derek Hoiem1
• A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It
• Artificial Intelligence 135 (2002) 154 Algorithm for optimal winner determination in
• MATHEMATICS OF OPERATIONS RESEARCH Vol. 35, No. 2, May 2010, pp. 494512
• Introduction Slack Spanners Applications Conclusion Spanners with Slack
• Online Learning of Assignments Matthew Streeter
• ame-theoretic solution concepts prescribe how rational parties should act in multiagent settings. This is non-
• In Proceedings IEEE International Conference on Robotics and Automation, May 1994. Optimal and Efficient Path Planning for Partially-Known Environments
• Applying Metric-Trees to Belief-Point POMDPs Joelle Pineau, Geoffrey Gordon
• Identifying graph-structured activation patterns in James Sharpnack
• On the Topology of Discrete Strategies Michael Erdmann
• Reduced-Rank Hidden Markov Models Sajid M. Siddiqi Byron Boots Geoffrey J. Gordon
• The Success and Failure of Tag-Mediated Evolution of Cooperation
• Efficient BDD-Based Planning for Non-Deterministic, Fault-Tolerant, and
• Spatial Reuse through Adaptive Interference Cancellation in Multi-Antenna Wireless Networks
• Efficient Temporal Mean Shift for Activity Recognition in Video , Rahul Sukthankar2,1
• Detecting Objects via Multiple Segmentations and Latent Topic Models
• RESEARCHCONTRlBuTlONS Programming
• Fine-Grained Privilege Separation for Web Applications Akshay Krishnamurthy Adrian Mettler David Wagner
• FREW STREET FORBES AVENUE
• Differential-Revelation VCG Mechanisms for Combinatorial Auctions
• A Decentralized Variable Ordering Method for Distributed Constraint Optimization
• 15-859(B) Machine Learning Theory Lecture 02/13/06, Avrim Blum
• Scheduling Jobs with Varying Parallelizability to Reduce Anupam Gupta
• Unbiased Look at Dataset Bias Antonio Torralba
• Appearing in Proceedings of the 17th Annual Conference on Computational Learning Theory, 2004. Performance Guarantees for Regularized
• Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker
• Approximate Solutions to Markov Decision Processes
• ExploitingModel Uncertainty
• SEARCHING AND PLANNING IN THE GAME OF HEX Hugh Brendan McMahan
• Lecture Notes for 36705, Fall 2006, Set 7
• 36705 Homework # 5 Solutions September 20, 2006
• Appearing in Proceedings of the 17th Annual Conference on Computational Learning Theory, 2004. Performance Guarantees for Regularized
• Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
• On the Existence of Unconditionally Privacy-Preserving Auction Protocols
• Some Properties of Matrix Norms Akshay Krishnamurthy
• Expressive Negotiation in Settings with Externalities Vincent Conitzer and Tuomas Sandholm
• Learning, Regret minimization, and Equilibria A. Blum and Y. Mansour
• An Online Algorithm for Maximizing Submodular Functions
• A Texas Hold'em poker player based on automated abstraction and real-time equilibrium computation
• On Correctness and Privacy in Distributed Mechanisms
• A Theory of Expressiveness in Mechanisms Michael Benisch
• Focused Belief Propagation for Query-Specific Inference Anton Chechetka Carlos Guestrin
• Better Automated Abstraction Techniques for Imperfect Information Games, with Application to Texas Hold'em
• Model-Driven Data Acquisition in Sensor Networks Amol Deshpande
• State Estimation of Probabilistic Hybrid Systems with Particle Filters
• The OD Theory of TOD: The Use and Limits of Temporal Information for Object Discovery
• Journal of Artificial Intelligence Research 38 (2010) 513-534 Submitted 04/10; published 08/10 Algorithms for Closed Under
• October 16, 2009 Erik Aurell, KTH Stockholm 1 Gaussian Belief with Dynamic Data and in
• AARTI SINGH Machine Learning Department, Carnegie Mellon University
• Efficiently Using Cost Maps For Planning Complex Dave Ferguson
• Sorting and Selection with Structured Costs Anupam Gupta
• Computing Reserve Prices and Identifying the Value Distribution in Real-world Auctions with Market Disruptions
• Complexity of (Iterated) Dominance Vincent Conitzer
• A Constant-Factor Approximation for Stochastic Steiner Forest
• Robust, Low-cost, Non-intrusive Sensing and Recognition of Seated Postures
• Incremental A S. Koenig and M. Likhachev
• Robust Planning in Domains with Stochastic Outcomes, Adversaries, and Partial
• Lecture Notes for 36705, Fall 2006, Set 14
• PATH CLEARANCE USING MULTIPLE SCOUT ROBOTS Maxim Likhachev* and Anthony Stentz
• Near-optimal Nonmyopic Value of Information in Graphical Models Andreas Krause Carlos Guestrin
• Learning to Improve Negotiation in Semi-Cooperative Agreement Problems
• Planning under Uncertainty for Reliable Health Care Nicholas Roy1
• CS 188 Notes: Introduction to Artificial Intelligence
• What Do the Sun and the Sky Tell Us About the Camera? Jean-Francois Lalonde, Srinivasa G. Narasimhan, and Alexei A. Efros
• Lecture given January 5, 2011, AMS Short Course on Computational Topology, JMM2011, New Orleans On the Topology of Discrete Planning with Uncertainty
• A Bootstrapping Approach for Multi-Relation Extraction Jon Elsas & Jaime Arguello
• Finite sample analysis of semi-supervised learning Technical Report ECE-08-03
• On embedding expanders into ` p Ji r' i Matou sek \Lambda
• Constructing Speculative Demand Functions in Equilibrium Markets
• 36705 Homework # 10 Solutions November 3, 2006
• Distributed Planning in Hierarchical Factored MDPs Carlos Guestrin
• eMediator: a Next Generation Electronic Commerce Server Tuomas Sandholm \Lambda
• Auction Mechanism Design for MultiRobot Coordination
• Carnegie Mellon University A Reference Manual
• The Power of Local Optimization: Approximation Algorithms for MaximumLeaf Spanning Tree
• Combinatorial Auctions with k-wise Dependent Valuations Vincent Conitzer
• Decentralized Estimation and Control of Graph Connectivity in Mobile Sensor Networks
• Safe Exchange Planner Tuomas Sandholm and Vincent Ferrandon
• Berkeley's Longest Paths or, why I took so long to graduate1
• Appearing in Advances in Neural information Processing Systems 21, 2009 Generative and Discriminative Learning with
• Dafna Shahaf Gates Center, Computer Science, CMU
• Planning for Manipulation with Adaptive Motion Primitives Benjamin J. Cohen, Gokul Subramanian, Sachin Chitta, Maxim Likhachev
• Walk-up Keyboard: An Efficient Low Overhead Interface For Transient Workers
• Connecting the Dots Between News Articles Dafna Shahaf
• Thesis Proposal Distributed Algorithms
• Intelligent Light Control using Sensor Networks Vipul Singhvi
• Mechanism Design and Deliberative Agents Kate Larson
• Online Latent Variable Detection in Sensor Networks Jimeng Sun Spiros Papadimitriou
• Exploiting Probabilistic Independence for Permutations: Proofs Jonathan Huang, Carlos Guestrin
• This article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the
• A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It
• Real-Time Planning in Dynamic and Partially
• 36705 Homework # 11 Solutions November 14, 2006
• Online Fitted Reinforcement Learning Geoffrey J. Gordon
• A Maximum Entropy Approach to Species Distribution Modeling Steven J. Phillips PHILLIPS@RESEARCH.ATT.COM
• Reinforcement Transitions
• For a system of cooperative mobile robots to be effective in realworld applications, it must be able to efficiently execute
• A Utility-Theoretic Approach to Privacy and Personalization Andreas Krause
• Solving Combinatorial Exchanges: Optimality via a Few Partial Bids
• Semi-supervised Learning with Weakly-Related Unlabeled Data: Towards Better Text Categorization
• Agents in Electronic Commerce: Component Technologies for Automated
• Coalitional Games in Open Anonymous Environments Makoto Yokoo, Vincent Conitzer,
• Modern Topics in Learning Maria-Florina Balcan
• SLIPstream: Scalable Low-latency Interactive Perception on Streaming Data
• Spatio-temporal Shape and Flow Correlation for Action Recognition , Rahul Sukthankar2,1
• Sensitivity of Harmonic Injection and its Spatial Evolution for Nonlinear Distortion Suppression in a TWT
• International Symposium on Artificial Intelligence and Robotics in Space (iSAIRAS), May, 2003 Efficient Monitoring for Planetary Rovers
• Note on Bounded Degree Spanners for Doubling Metrics T-H. Hubert Chan Anupam Gupta Bruce M. Maggs Shuheng Zhou
• Nonmyopic Active Learning of Gaussian Processes: An ExplorationExploitation Approach
• Appearing in Advances in Neural Information Processing Systems 18, 2006. Correcting sample selection bias in maximum
• Auctions with Untrustworthy Bidders Sviatoslav Braynov
• Quorum Placement in Networks: Minimizing Network Congestion
• Underground coal mining is an industry well suited for robotic automation. Human operators are severely hampered in
• Confidence-Based Robot Policy Learning from Demonstration
• Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees Joseph E. Gonzalez Yucheng Low Arthur Gretton1
• ARA*: Anytime A* with Provable Bounds on Sub-Optimality
• Minimal Preference Elicitation in Combinatorial Auctions Wolfram Conen
• Real-Time Adaptive A* Sven Koenig
• Small Hop-diameter Sparse Spanners for Doubling Metrics T-H. Hubert Chan Anupam Gupta
• Multi-Robot Negotiation: Approximating the Set of Subgame Perfect Equilibria in General-Sum Stochastic Games
• Game Theory-Based Opponent Modeling in Large Imperfect-Information Games
• Ecient Probabilistic Inference with Partial Ranking Queries Jonathan Huang
• Unifying Discriminative Visual Codebook Generation with Classifier Training for Object Category Recognition
• Delay-Differentiated Gossiping in Delay Tolerant Parameswaran Ramanathan and Aarti Singh
• To appear in Proc. of the National Conference on Artificial Intelligence (AAAI 2004) San Jose, California, July 2004
• NONPARAMETRIC SET ESTIMATION PROBLEMS IN STATISTICAL INFERENCE AND LEARNING
• Markov Random Fields Models for Multi-Robot Teams in Cyber-Physical Systems
• Multi-source Spanning Trees: Algorithms for Minimizing Source Eccentricities
• Online convex optimization in the bandit setting: gradient descent without a gradient
• Appearing in Advances in Neural Information Processing Systems 18, 2006. Correcting sample selection bias in maximum
• Emotional Communication Robot: WAMOEBA-2R 1 Emotional Communication Robot: WAMOEBA-2R
• 15-859(B) Machine Learning Theory Avrim Blum (avrim@cs.cmu.edu) Lecture 1: January 18, 2006
• Communication Complexity of Common Voting Rules Vincent Conitzer
• c 2007 by Dafna Shahaf. All rights reserved. LOGICAL FILTERING AND LEARNING IN PARTIALLY OBSERVABLE WORLDS
• Journal of Artificial Intelligence Research 23 (2005) 1-40 Submitted 05/04; published 01/05 Finding Approximate POMDP Solutions Through Belief
• On Hierarchical Routing in Doubling Metrics Hubert T-H. Chan
• Manuela M. Veloso School of Computer Science, Carnegie Mellon University, Pittsburgh PA 15213-3819
• A Theory of the Quasi-static World Brandon C. S. Sanders and Randal C. Nelson
• Student Name: Date of Presentation: SPEAKING SKILLS EVALUATION
• Semi-Supervised Collaborative Text Classification
• Computing Optimal Outcomes under an Expressive Representation of Settings with Externalities
• Identifying graph-structured activation patterns in James Sharpnack
• Learning Low Dimensional Predictive Representations Matthew Rosencrantz MROSEN@CS.CMU.EDU
• Multiple Domain User Personalization Yucheng Low
• Planning for Landing Site Selection in the Aerial Supply Delivery Aleksandr Kushleyev
• Identification and Representation of Homotopy Classes of Trajectories for Search-based Path
• Planning in Domains with Cost Function Dependent Actions Mike Phillips and Maxim Likhachev
• Experimental Shotgun Scalability Analysis May 3, 2011
• Hilbert Space Embeddings of Hidden Markov Models
• Search-Based Planning with Provable Suboptimality Bounds for Continuous State Spaces
• Incremental Relabeling for Active Learning with Noisy Crowdsourced Annotations
• Path Planning with Adaptive Dimensionality Kalin Gochev
• An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
• Benchmark report for Lasso and Compressed Sensing algorithms
• Strategy Purification Sam Ganzfried, Tuomas Sandholm, and Kevin Waugh
• Introduction to Facilities 2011 http://www.cs.cmu.edu/~help/introduction/index.html
• JID:YJCSS AID:2485 /FLA [m3G; v 1.51; Prn:12/04/2011; 13:31] P.1 (1-13) Journal of Computer and System Sciences ()
• Closing the Learning-Planning Loop with Predictive State Representations
• A Framework for Automated Bundling and Pricing Using Purchase Data
• Parallel Coordinate Descent for L1-Regularized Loss Minimization: Theory Supplement
• Benchmark report for Logreg algorithms Lasso Linear Regression Bench
• Artificial Intelligence 175 (2011) 12511271 Contents lists available at ScienceDirect
• Measuring and Reducing Observational Latency when Recognizing Actions Syed Z. Masood Chris Ellis
• Relational Learning via Collective Matrix Factorization Ajit P. Singh
• Minimax Localization of Structural Information in Large Noisy Matrices
• Multi-hypothesis Motion Planning for Visual Object Tracking Haifeng Gong
• Journal of Artificial Intelligence Research 19 (2003) 399-468 Submitted 1/02; published 10/03 Efficient Solution Algorithms for Factored MDPs
• AARTI SINGH Machine Learning Department, Carnegie Mellon University
• Feature Seeding for Action Recognition Pyry Matikainen Rahul Sukthankar
• Algorithms and Models for Problems in Michael Dinitz
• Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures
• Research Statement: Approximation Algorithms for Networking Dr. Michael Dinitz
• Max-Margin Markov Networks Ben Taskar Carlos Guestrin Daphne Koller
• A Derivation of the 3-entity-type model The 3-entity-type model consists of two relationship matrices, a m n matrix X and a n r matrix Y . In
• Noise Thresholds for Spectral Clustering Sivaraman Balakrishnan Min Xu Akshay Krishnamurthy Aarti Singh
• 15-251: Great Theoretical Ideas in Computer Science 15251 Staff Notes on Graph Theory (draft!!) January 29, 2012
• Planning for Multi-Robot Exploration With Multiple Objective Utility Functions
• 15-251: Great Theoretical Ideas in Computer Science Anupam Gupta Notes on Combinatorial Games (draft!!) January 29, 2012
• Homework 1 15-210: Parallel and Sequential Data Structures and Algorithms (Spring'12) due: wed, jan 25 @ 11:59pm
• Ravishankar Krishnaswamy RESEARCH STATEMENT My primary research interest is on the design and analysis of algorithms that can handle uncertainty in the input,
• Combining Global and Local Planning with Guarantees on Completeness
• Multi-hypothesis Motion Planning for Visual Object Tracking Haifeng Gong
• Homework 3 15-210: Parallel and Sequential Data Structures and Algorithms (Spring'12) tag --Version 1.2 due: thu, feb 16 @ 11:59pm (NO LATE DAYS)
• Homework 5 15-210: Parallel and Sequential Data Structures and Algorithms (Spring'12) tag --Version 1.1 due: thu, mar 8 @ 11:59pm
• Sample Complexity of Composite Likelihood Joseph K. Bradley Carlos Guestrin
• Trains of Thought: Generating Information Maps Dafna Shahaf
• Thesis Proposal Parallel Learning and Inference in
• Eric Poe Xing (412) 268-2559 (Office)
• Residual Splash for Optimally Parallelizing Belief Propagation Joseph E. Gonzalez
• Homework 4 15-210: Parallel and Sequential Data Structures and Algorithms (Spring'12) tag --Version 1.0 due: tue, feb 21 @ 11:59pm
• 15-251: Great Theoretical Ideas in Computer Science 15251 Staff Notes on The Lambda Calculus (draft!!) January 29, 2012
• 15-251: Great Theoretical Ideas in Computer Science 15251 Staff Notes on Graph Theory II (draft!!) January 29, 2012
• 15210: Parallel and Sequential Data Structures and Algorithms Midterm Examination I
• Planning with Adaptive Dimensionality for Mobile Manipulation Kalin Gochev
• 15-251: Great Theoretical Ideas in Computer Science Anupam Gupta Notes on Pancakes (draft!!) January 29, 2012
• Homework 2 15-210: Parallel and Sequential Data Structures and Algorithms (Spring'12) due: tue, feb 7 @ 11:59pm
• Search-based Planning for Dual-arm Manipulation with Upright Orientation Constraints
• Distributed Parallel Inference on Large Factor Graphs Joseph E. Gonzalez
• 15-251: Great Theoretical Ideas in Computer Science Anupam Gupta Generating Functions (draft!!) January 29, 2012
• Abstract--Path planning in dynamic environments with moving obstacles is computationally complex since it requires
• Navigation in Three-Dimensional Cluttered Environments for Mobile Manipulation
• Planning for Landing Site Selection in the Aerial Supply Delivery Aleksandr Kushleyev