3894 search results - page 111 / 779 » Approximation Algorithms for Biclustering Problems |
315
click to vote
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...
137
click to vote
IPL
2000
15 years 6 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
166
click to vote
WINE
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
229
click to vote
FOCS
2005
IEEE
16 years 2 hour ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
188
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...