197 search results - page 15 / 40 » Improved Approximation Algorithms for Bipartite Correlation ... |
RECOMB
2008
Springer
14 years 7 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
IPL
1998
13 years 7 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
ISNN
2011
Springer
12 years 10 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
DAGSTUHL
2007
13 years 9 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...