3894 search results - page 542 / 779 » Approximation Algorithms for Biclustering Problems |
157
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
146
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
139
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
118
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
126
click to vote
SIAMSC
2008
15 years 3 months ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...