4894 search results - page 513 / 979 » The Guarding Problem - Complexity and Approximation |
190
Voted
TKDE
2012
13 years 7 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
145
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
158
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...
118
click to vote
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...
169
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper, we present a new method to change the illumination condition of a face image, with unknown face geometry and albedo information. This problem is particularly diffic...