5595 search results - page 811 / 1119 » Approximation Algorithms for Clustering Problems |
179
click to vote
CPM
2007
Springer
16 years 27 days 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...
150
click to vote
COCOA
2008
Springer
15 years 8 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...
167
click to vote
SIAMSC
2008
15 years 6 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...
161
click to vote
IPL
2007
15 years 6 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
190
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Filtering based algorithms have become popular in tracking human body pose. Such algorithms can suffer the curse of dimensionality due to the high dimensionality of the pose state ...