3894 search results - page 353 / 779 » Approximation Algorithms for Biclustering Problems |
153
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
152
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
193
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
181
click to vote
IPL
2007
15 years 6 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...