740 search results - page 15 / 148 » An approximation ratio for biclustering |
119
click to vote
JDA
2008
15 years 1 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
121
click to vote
WINET
2010
15 years 7 days ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
111
Voted
ICALP
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
126
Voted
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
125
click to vote
ADHOCNOW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...