2354 search results - page 356 / 471 » Randomness, Stochasticity and Approximations |
182
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
191
click to vote
CVPR
2007
IEEE
16 years 8 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...
169
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
128
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
156
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...