569 search results - page 107 / 114 » Online Bounds for Bayesian Algorithms |
FOCS
2008
IEEE
14 years 11 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Statistical background modelling and subtraction has proved to be a popular and effective class of algorithms for segmenting independently moving foreground objects out from a sta...
113
click to vote
IUI
2010
ACM
15 years 6 months ago
2010
ACM
Online news reading has become very popular as the web provides access to news articles from millions of sources around the world. A key challenge of news websites is to help user...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...