Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
UAI
2003
10 years 5 months ago
Decentralized Sensor Fusion with Distributed Particle Filters
This paper presents a scalable Bayesian technique for decentralized state estimation from multiple platforms in dynamic environments. As has long been recognized, centralized arch...
Matthew Rosencrantz, Geoffrey J. Gordon, Sebastian...
UAI
2003
10 years 5 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
UAI
2003
10 years 5 months ago
Policy-contingent abstraction for robust robot control
ontingent abstraction for robust robot control Joelle Pineau, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 This pape...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
UAI
2003
10 years 5 months ago
Optimal Limited Contingency Planning
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications wher...
Nicolas Meuleau, David E. Smith
UAI
2003
10 years 5 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
UAI
2003
10 years 5 months ago
Practically Perfect
We prove that perfect distributions exist when using a finite number of bits to represent the parameters of a Bayesian network. In addition, we provide an upper bound on the prob...
Christopher Meek, David Maxwell Chickering
UAI
2003
10 years 5 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
UAI
2003
10 years 5 months ago
On Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Jens D. Nielsen, Tomás Kocka, José M...
UAI
2003
10 years 5 months ago
Systematic vs. Non-systematic Algorithms for Solving the MPE Task
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
Radu Marinescu 0002, Kalev Kask, Rina Dechter
UAI
2003
10 years 5 months ago
A Linear Belief Function Approach to Portfolio Evaluation
We show how to use linear belief functions to represent market information and financial knowledge, including complete ignorance, statistical observations, subjective speculations...
Liping Liu, Catherine Shenoy, Prakash P. Shenoy
books