Sciweavers

569 search results - page 31 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
ATVA
2011
Springer
254views Hardware» more  ATVA 2011»
13 years 9 months ago
Formal Analysis of Online Algorithms
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
Benjamin Aminof, Orna Kupferman, Robby Lampert
SUM
2009
Springer
15 years 4 months ago
Modeling Unreliable Observations in Bayesian Networks by Credal Networks
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...
Alessandro Antonucci, Alberto Piatti
AAAI
2006
14 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
COCOON
2006
Springer
15 years 1 months ago
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yu...
CVPR
2007
IEEE
15 years 4 months ago
Target Tracking with Online Feature Selection in FLIR Imagery
We present a particle filter-based target tracking algorithm for FLIR imagery. A dual foreground and background model is proposed for target representation which supports robust ...
Vijay Venkataraman, Guoliang Fan, Xin Fan