Table of Contents

• Expectation Maximization and Complex Duration Distributions for Continuous Time Bayesian NetworksUri Nodelman, Christian R. Shelton, Daphne Koller. [doi]
• On Privacy-Preserving HistogramsShuchi Chawla, Cynthia Dwork, Frank McSherry, Kunal Talwar. [doi]
• Learning Factor Graphs in Polynomial Time & Sample ComplexityPieter Abbeel, Daphne Koller, Andrew Y. Ng. 1-9 [doi]
• Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent VariablesAyesha R. Ali, Thomas Richardson, Peter Spirtes, Jiji Zhang. 10-17 [doi]
• Learning from Sparse Data by Exploiting Monotonicity ConstraintsEric Altendorf, Angelo C. Restificar, Thomas G. Dietterich. 18-26 [doi]
• A Unified Setting for Inference and Decision: An Argumentation-based ApproachLeila Amgoud. 26-33 [doi]
• On the Value of CorrelationItai Ashlagi, Dov Monderer, Moshe Tennenholtz. 34-41 [doi]
• Local Utility Elicitation in GAI ModelsDarius Braziunas, Craig Boutilier. 42-49 [doi]
• Models for Truthful Online Double AuctionsJonathan Bredin, David C. Parkes. 50-59 [doi]
• Cost Sensitive Reachability Heuristics for Handling State UncertaintyDaniel Bryce, Subbarao Kambhampati. 60-68 [doi]
• Efficient Algorithm for Estimation of Qualitative Expected Utility in Possibilistic Case-based ReasoningRyszard Kowalczyk. 69-76 [doi]
• Counterfactual Reasoning in Linear Structural Equation ModelsZhihong Cai, Manabu Kuroki. 77-84 [doi]
• Nonparametric Bayesian LogicPeter Carbonetto, Jacek Kisynski, Nando de Freitas, David Poole. 85-93 [doi]
• Use of Dempster-Shafer Conflict Metric to Detect Interpretation InconsistencyJennifer Carlson, Robin R. Murphy. 94-103 [doi]
• Counterexample-guided PlanningKrishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar. 104-111 [doi]
• Exploiting Evidence in Probabilistic InferenceMark Chavira, David Allen, Adnan Darwiche. 112-127 [doi]
• On Bayesian Network Approximation by Edge DeletionAdnan Darwiche, Hei Chan, Arthur Choi. 128-135 [doi]
• Hybrid Bayesian Networks with Linear Deterministic VariablesBarry R. Cobb, Prakash P. Shenoy. 136-144 [doi]
• Common Voting Rules as Maximum Likelihood EstimatorsVincent Conitzer, Tuomas Sandholm. 145-152 [doi]
• Belief Updating and Learning in Semi-Qualitative Probabilistic NetworksCassio Polpo de Campos, Fabio Gagliardi Cozman. 153-160 [doi]
• Stable Independence in Perfect MapsPeter R. de Waal, Linda C. van der Gaag. 161-168 [doi]
• Unstructuring User Preferences: Efficient Non-Parametric Utility RevelationCarmel Domshlak, Thorsten Joachims. 169-177 [doi]
• On the Number of Experiments Sufficient and in the Worst Case Necessary to Identify All Causal Relations Among N VariablesFrederick Eberhardt, Clark Glymour, Richard Scheines. 178-184 [doi]
• Planning in POMDPs Using Multiplicity AutomataEyal Even-Dar, Sham M. Kakade, Yishay Mansour. 185-192 [doi]
• Learning Bayesian Network Parameters with Prior Knowledge about Context-Specific Qualitative InfluencesA. J. Feelders, Linda C. van der Gaag. 193-200 [doi]
• Metrics for Markov Decision Processes with Infinite State SpacesNorm Ferns, Prakash Panangaden, Doina Precup. 201-208 [doi]
• Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete ConstraintsVibhav Gogate, Rina Dechter. 209-216 [doi]
• Modeling Transportation Routines using Hybrid Dynamic Mixed NetworksVibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca. 217-224 [doi]
• Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash EquilibriaGianluigi Greco, Francesco Scarcello. 225-232 [doi]
• Maximum Margin Bayesian NetworksYuhong Guo, Dana F. Wilkinson, Dale Schuurmans. 233-242 [doi]
• Evidence with Uncertain LikelihoodsJoseph Y. Halpern, Riccardo Pucella. 243-250 [doi]
• Unsupervised Activity Discovery and Characterization From Event-StreamsRafay Hammid, Siddhartha Maddi, Amos Y. Johnson, Aaron F. Bobick, Irfan A. Essa, Charles Lee Isbell Jr.. 251-258 [doi]
• Bayes Blocks: An Implementation of the Variational Bayesian Building Blocks FrameworkMarkus Harva, Tapani Raiko, Antti Honkela, Harri Valpola, Juha Karhunen. 259-266 [doi]
• On the Detection of Concept Changes in Time-Varying Data Stream by Testing ExchangeabilityShen-Shyang Ho, Harry Wechsler. 267-274 [doi]
• Prediction, Expectation, and Surprise: Methods, Designs, and Study of a Deployed Traffic Forecasting ServiceEric Horvitz, Johnson Apacible, Raman Sarin, Lin Liao. 275-283 [doi]
• Local Markov Property for Models Satisfying Composition AxiomChangsung Kang, Jin Tian. 284-291 [doi]
• A Heuristic Search Algorithm for Solving First-Order MDPsEldar Karabaev, Olga Skvortsova. 292-299 [doi]
• Say EM for Selecting Probabilistic Models for Logical SequencesKristian Kersting, Tapani Raiko. 300-307 [doi]
• Toward Practical N2 Monte Carlo: the Marginal Particle FilterMike Klaas, Nando de Freitas, Arnaud Doucet. 308-315 [doi]
• On the Optimality of Tree-reweighted Max-product Message-passingVladimir Kolmogorov, Martin J. Wainwright. 316-323 [doi]
• Near-optimal Nonmyopic Value of Information in Graphical ModelsAndreas Krause, Carlos Guestrin. 324-331 [doi]
• Learning about Individuals from Group StatisticsNando de Freitas, Hendrik Kück. 332-339 [doi]
• The Graphical Identification for Total Effects by using Surrogate VariablesManabu Kuroki, Zhihong Cai, Hiroki Motogaito. 340-345 [doi]
• Of Starships and Klingons: Bayesian Logic for the 23rd CenturyKathryn B. Laskey, Paulo Cesar G. da Costa. 346-353 [doi]
• Existence and Finiteness Conditions for Risk-Sensitive Planning: Results and ConjecturesYaxin Liu, Sven Koenig. 354-363 [doi]
• A Differential Semantics of Lazy AR PropagationAndres Madsen. 364-371 [doi]
• Representation Policy IterationSridhar Mahadevan. 372-379 [doi]
• The Relationship Between AND/OR Search and Variable EliminationRobert Mateescu, Rina Dechter. 380-387 [doi]
• A Conditional Random Field for Discriminatively-trained Finite-state String Edit DistanceAndrew McCallum, Kedar Bellare, Fernando C. N. Pereira. 388-395 [doi]
• Sufficient Conditions for Convergence of Loopy Belief PropagationJoris M. Mooij, Hilbert J. Kappen. 396-403 [doi]
• A Submodular-supermodular Procedure with Applications to Discriminative Structure LearningMukund Narasimhan, Jeff A. Bilmes. 404-412 [doi]
• Obtaining Calibrated Probabilities from BoostingAlexandru Niculescu-Mizil, Rich Caruana. 413 [doi]
• Expectation Propagation for Continuous Time Bayesian NetworksUri Nodelman, Daphne Koller, Christian R. Shelton. 431-440 [doi]
• Self-Confirming Price Prediction for Bidding in Simultaneous Ascending AuctionsAnna Osepayshvili, Michael P. Wellman, Daniel M. Reeves, Jeffrey K. MacKie-Mason. 441-449 [doi]
• Robotic Mapping with Polygonal Random FieldsMark Paskin, Sebastian Thrun. 450-458 [doi]
• Modifying Bayesian Networks by Probability ConstraintsYun Peng, Zhongli Ding. 459-466 [doi]
• Asynchronous Dynamic Bayesian NetworksAvi Pfeffer, Terry Tai. 467-476 [doi]
• A Revision-Based Approach to Resolving Conflicting InformationGuilin Qi, Weiru Liu, David A. Bell. 477-484 [doi]
• Exploiting Evidence-dependent Sensitivity BoundsSilja Renooij, Linda C. van der Gaag. 485-492 [doi]
• The DLR Hierarchy of Approximate InferenceMichal Rosen-Zvi, Michael I. Jordan, Alan L. Yuille. 493-500 [doi]
• Predictive Linear-Gaussian Models of Stochastic Dynamical SystemsMatthew R. Rudary, Satinder P. Singh, David Wingate. 501-508 [doi]
• Approximate Linear Programming for First-order MDPsScott Sanner, Craig Boutilier. 509-517 [doi]
• Two-Way Latent Grouping Model for User Preference PredictionEerika Savia, Kai Puolamäki, Janne Sinkkonen, Samuel Kaski. 518-524 [doi]
• Discovery of Non-gaussian Linear Causal Models using ICAShohei Shimizu, Aapo Hyvärinen, Yutaka Kano, Patrik O. Hoyer. 525-533 [doi]
• Unsupervised Spectral LearningSusan Shortreed, Marina Meila. 534-541 [doi]
• Point-Based POMDP Algorithms: Improved Analysis and ImplementationTrey Smith, Reid G. Simmons. 542-547 [doi]
• Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian NetworksMarc Teyssier, Daphne Koller. 548-549 [doi]
• Bayes? Bluff: Opponent Modelling in PokerFinnegan Southey, Michael H. Bowling, Bryce Larson, Carmelo Piccione, Neil Burch, Darse Billings, D. Chris Rayner. 550-558 [doi]
• Description Logics with Fuzzy Concrete DomainsUmberto Straccia. 559-567 [doi]
• Piecewise Training for Undirected ModelsCharles A. Sutton, Andrew McCallum. 568-575 [doi]
• MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPsDaniel Szer, François Charpillet, Shlomo Zilberstein. 576-590 [doi]
• Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge ReplacementJin Tian. 591-598 [doi]
• A Model for Reasoning with Uncertain Rules in Event Composition SystemsSegev Wasserkrug, Avigdor Gal, Opher Etzion. 599-608 [doi]
• Structured Region Graphs: Morphing EP into GBPMax Welling, Thomas P. Minka, Yee Whye Teh. 609-614 [doi]
• Qualitative Decision Making Under Possibilistic Uncertainty: Toward more Discriminating CriteriaPaul Weng. 615-622 [doi]
• An Algorithm for Computing Stochastically Stable Distributions with Applications to Multiagent Learning in Repeated GamesJohn Wicks, Amy R. Greenwald. 623-632 [doi]
• Mining Associated Text and Images with Dual-Wing HarmoniumsEric P. Xing, Rong Yan, Alexander G. Hauptmann. 633-641 [doi]
• A Function Approximation Approach to Estimation of Policy Gradient for POMDP with Structured PoliciesHuizhen Yu. 642-657 [doi]
• Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial GrammarsLuke S. Zettlemoyer, Michael Collins. 658-666 [doi]
• A Transformational Characterization of Markov Equivalence for Directed Acyclic Graphs with Latent VariablesJiji Zhang, Peter Spirtes. 667-674 [doi]
• Efficient Test Selection in Active Diagnosis via Entropy ApproximationAlice X. Zheng, Irina Rish, Alina Beygelzimer. 675 [doi]