Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

123

Voted

CDC
2009
IEEE

156views Control Systems» more CDC 2009»

Polynomial-time solution of change detection problems

15 years 3 days ago

Polynomial-time solution of change detection problems

Download www.nt.ntnu.no

Change detection problems are ubiquitous, but there are no existing tractable techniques for -exact solution of discrete-time, discrete-observation problems. A polynomialtime algorithm for solution of Markov Bayes change detection problems is presented. The algorithm combines backward induction on a tree with induction of bounds on the value function at specific points from those of neighboring points.

Joshua D. Isom, Robert E. LaBarre, Richard D. Braa

Real-time Traffic

CDC 2009 | Combines Backward Induction | Control Systems | Detection Problems | Markov Bayes |

claim paper

Related Content

» Anomaly application change or workload change towards automated detection of application p...

» Static Detection of Livelocks in Ada Multitasking Programs

» The Cluttered Background Problem for Active Contours A MinimumLatency Solution

» On the NPcompleteness of regular 2D FPGA routing architectures and a novel solution

» An ILP for the metroline crossing problem

» Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors

» Detecting and resolving unsound workflow views for correct provenance analysis

» Curious snakes A minimum latency solution to the cluttered background problem in active co...

» Curious Snakes a minimumlatency solution to the cluttered background problem in active con...

Post Info
More Details (n/a)

Added	16 Feb 2011
Updated	16 Feb 2011
Type	Journal
Year	2009
Where	CDC
Authors	Joshua D. Isom, Robert E. LaBarre, Richard D. Braatz

Comments (0)