5595 search results - page 236 / 1119 » Approximation Algorithms for Clustering Problems |
234
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Cluster analysis is a crucial tool in several biological and medical studies dealing with microarray data. Such studies pose challenging statistical problems due to di...
196
Voted
STOC
2010
ACM
15 years 11 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
169
click to vote
ALGORITHMICA
1999
15 years 6 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
151
Voted
DAC
1998
ACM
16 years 7 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
170
click to vote
SIAMSC
2010
15 years 4 months ago
2010
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...