10414 search results - page 1950 / 2083 » An efficient algorithm for Co-segmentation |
139
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
118
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
111
click to vote
AAAI
2010
15 years 4 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
117
click to vote
DPHOTO
2010
15 years 4 months ago
2010
Recent research demonstrates the advantage of designing electro-optical imaging systems by jointly optimizing the optical and digital subsystems. The optical systems designed usin...
134
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...