3875 search results - page 421 / 775 » Approximation algorithms for the 0-extension problem |
175
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
198
click to vote
COMPGEOM
2004
ACM
16 years 6 days ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
215
Voted
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
186
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
169
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...