5595 search results - page 438 / 1119 » Approximation Algorithms for Clustering Problems |
204
Voted
RECOMB
2010
Springer
16 years 1 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
175
click to vote
APCSAC
2006
IEEE
16 years 28 days ago
2006
IEEE
In the ubiquitous era, it is necessary to research the architectures of multiprocessor system with high performance and low power consumption. A simulator developed in high level l...
213
Voted
BMCBI
2006
15 years 7 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
163
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
174
Voted
CCGRID
2003
IEEE
16 years 5 days ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...