3894 search results - page 79 / 779 » Approximation Algorithms for Biclustering Problems |
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Cross-layer design and operation of wireless networks has attracted significant interest in the last decade, yet some basic problems in the area remain unsolved. In this paper, w...
143
click to vote
ICCSA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
214
click to vote
COMBINATORICA
2010
15 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
169
click to vote
GECCO
2007
Springer
16 years 10 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
146
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...