3894 search results - page 242 / 779 » Approximation Algorithms for Biclustering Problems |
167
click to vote
ANTSW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
166
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
206
click to vote
CBMS
2005
IEEE
16 years 6 days ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
159
click to vote
WSCG
2001
15 years 8 months ago
2001
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...
182
click to vote
TOC
2010
15 years 1 months ago
2010
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...