Sciweavers

2040 search results - page 122 / 408
» Approximate Expectation Maximization
Sort
View
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
15 years 8 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
ICML
2009
IEEE
16 years 4 months ago
Analytic moment-based Gaussian process filtering
We propose an analytic moment-based filter for nonlinear stochastic dynamic systems modeled by Gaussian processes. Exact expressions for the expected value and the covariance matr...
Marc Peter Deisenroth, Marco F. Huber, Uwe D. Hane...
ATAL
2009
Springer
15 years 9 months ago
Self-deceptive decision making: normative and descriptive insights
Computational modeling of human belief maintenance and decision-making processes has become increasingly important for a wide range of applications. We present a framework for mod...
Jonathan Y. Ito, David V. Pynadath, Stacy C. Marse...
WSCG
2004
106views more  WSCG 2004»
15 years 4 months ago
Recognition of Occluded Objects Using Curvature
New approaches of object representation reliable for partially occluded objects recognition are introduced in this article. Objects are represented by their boundaries, which are ...
Filip Krolupper
INFOCOM
2012
IEEE
13 years 5 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...